Abstract
Let G be a graph with order p, size q and component number ω. For each i between p − ω and q, let \(C_i (G)\) be the family of spanning i-edge subgraphs of G with exactly ω components. For an integer-valued graphical invariant φ if H → H ′ is an adjacent edge transformation (AET) implies |φ(H)-φ(H')|≤1 then φ is said to be continuous with respect to AET. Similarly define the continuity of φ with respect to simple edge transformation (SET). Let M j(φ) and m j(φ) be the invariants defined by \(M_j (\varphi )(H) = \mathop {\max }\limits_{T \in C_j (H)} \varphi (T),m_j (\varphi )(H) = \mathop {\min }\limits_{T \in C_j (H)} \varphi (T)\). It is proved that both M p−ω(φ) and m p−ω(φ;) interpolate over \(\mathcal{C}_i (G),p - \omega \leqslant i \leqslant q\), if φ is continuous with respect to AET, and that M j(φ) and m j(φ) interpolate over \(\mathcal{C}_i (G),p - \omega \leqslant j \leqslant i \leqslant q\), if φ is continuous with respect to SET. In this way a lot of known interpolation results, including a theorem due to Schuster etc., are generalized.
Similar content being viewed by others
References
C.A. Barefoot: Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size. Discrete Math. 49 (1984), 109–112.
M.C. Cai: A solution of Chartrand's problem on spanning trees. Acta Mathematica Applicata Sinica 1 (1994), no. 2, 97–98.
The Theory and Applications of Graphs. Proc. Fourth Intern. Conf. on Graph Theory Applications, 1980 (G. Chartrand, etc., eds.). Wiley, New York, 1981, pp. 610.
F. Harary: Conditional colorability in graphs. Graphs and Applications (F. Harary and J. S. Maybee, eds.). Wiley, New York, 1985, pp. 127–136.
F. Harary and M. Plantholt: Classification of interpolation theorems for spanning trees and other families of spanning subgraphs. J. Graph Theory 13 (1989), 703–712.
C.A. Holzmann and F. Harary: On the tree graph of a matroid. SIAM J. Appl. Math. 22 (1972), 187–193.
Y. X. Lin: A simpler proof of interpolation theorem for spanning trees. Kexue Tongbao (English edition) 30 (1985), 134.
M. Lewinter: Interpolation theorem for the number of degree-preserving vertices of qspanning trees. IEEE Trans. Circuit and Systems 34 (1987), 205.
S. Schuster: Interpolation theorem for the number of end-vertices of spanning trees. J. Graph Theory 7 (1983), 203–208.
D.J.A. Welsh: Matroid Theory. Academic Press, London, 1976.
S.M. Zhou: Matroid tree graphs and interpolation theorems. Discrete Math. 137 (1995), 395–397.
S.M. Zhou: An interpolation theorem of graphs. A Friendly Collection of Math. Papers I. Jilin University Press, 1990, pp. 154–156.
S.M. Zhou: Several interolation theorems for graphs. Graph Theory Notes of New York XXIX (1995), 18–20.
S.M. Zhou: Conditional invariants and interpolation theorems for graphs. Submitted.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhou, S. Interpolation theorems for a family of spanning subgraphs. Czechoslovak Mathematical Journal 48, 45–53 (1998). https://doi.org/10.1023/A:1022411426718
Issue Date:
DOI: https://doi.org/10.1023/A:1022411426718