Abstract
For a nontrivial connected graph F, the F-degree of a vertex υ in a graph G is the number of copies of F in G containing υ. A graph G is F-continuous (or F-degree continuous) if the F-degrees of every two adjacent vertices of G differ by at most 1. All P3-continuous graphs are determined. It is observed that if G is a nontrivial connected graph that is F-continuous for all nontrivial connected graphs F, then either G is regular or G is a path. In the case of a 2-connected graph F, however, there always exists a regular graph that is not F-continuous. It is also shown that for every graph H and every 2-connected graph F, there exists an F-continuous graph G containing H as an induced subgraph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. Chartrand, L. Eroh, M. Schultz and P. Zhang: Anin troduction to analytic graph theory. Utilitas Math. To appear.
G. Chartrand, K. S. Holbert, O. R. Oellermann and H.C. Swart: F-degrees in graphs. Ars Combin. 24 (1987), 133–148.
G. Chartrand and L. Lesniak: Graphs & Digraphs (third edition). Chapman & Hall, New York, 1996.
P. Erdös and H. Sachs: Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl. Wiss Z. Univ. Halle, Math-Nat. 12 (1963), 251–258.
J. Gimbel and P. Zhang: Degree-continuous graphs. Czechoslovak Math. J. To appear.
D. König: Ñber Graphen und ihre Anwendung auf Determinantheorie und Mengenlehre. Math. Ann. 77 (1916), 453–465.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chartrand, G., Jarrett, E.B., Saba, F. et al. F-Continuous Graphs. Czechoslovak Mathematical Journal 51, 351–361 (2001). https://doi.org/10.1023/A:1013751031651
Issue Date:
DOI: https://doi.org/10.1023/A:1013751031651