Results on $F$-continuous graphs
Czechoslovak Mathematical Journal, Tome 59 (2009) no. 1, pp. 51-60
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
For any nontrivial connected graph $F$ and any graph $G$, the {\it $F$-degree} of a vertex $v$ in $G$ is the number of copies of $F$ in $G$ containing $v$. $G$ is called {\it $F$-continuous} if and only if the $F$-degrees of any two adjacent vertices in $G$ differ by at most 1; $G$ is {\it $F$-regular} if the $F$-degrees of all vertices in $G$ are the same. This paper classifies all $P_4$-continuous graphs with girth greater than 3. We show that for any nontrivial connected graph $F$ other than the star $K_{1,k}$, $k \geq 1$, there exists a regular graph that is not $F$-continuous. If $F$ is 2-connected, then there exists a regular $F$-continuous graph that is not $F$-regular.
Classification :
05C12, 05C78
Keywords: continuous; $F$-continuous; $F$-regular; regular graph
Keywords: continuous; $F$-continuous; $F$-regular; regular graph
@article{CMJ_2009__59_1_a3,
author = {Draganova, Anna},
title = {Results on $F$-continuous graphs},
journal = {Czechoslovak Mathematical Journal},
pages = {51--60},
publisher = {mathdoc},
volume = {59},
number = {1},
year = {2009},
mrnumber = {2486615},
zbl = {1224.05434},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMJ_2009__59_1_a3/}
}
Draganova, Anna. Results on $F$-continuous graphs. Czechoslovak Mathematical Journal, Tome 59 (2009) no. 1, pp. 51-60. http://geodesic.mathdoc.fr/item/CMJ_2009__59_1_a3/