Geodesic
Results on $F$-continuous graphs
Czechoslovak Mathematical Journal, Tome 59 (2009) no. 1, pp. 51-60 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

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.
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 
@article{CMJ_2009_59_1_a3,
     author = {Draganova, Anna},
     title = {Results on $F$-continuous graphs},
     journal = {Czechoslovak Mathematical Journal},
     pages = {51--60},
     year = {2009},
     volume = {59},
     number = {1},
     mrnumber = {2486615},
     zbl = {1224.05434},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMJ_2009_59_1_a3/}
}
TY  - JOUR
AU  - Draganova, Anna
TI  - Results on $F$-continuous graphs
JO  - Czechoslovak Mathematical Journal
PY  - 2009
SP  - 51
EP  - 60
VL  - 59
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/CMJ_2009_59_1_a3/
LA  - en
ID  - CMJ_2009_59_1_a3
ER  - 
%0 Journal Article
%A Draganova, Anna
%T Results on $F$-continuous graphs
%J Czechoslovak Mathematical Journal
%D 2009
%P 51-60
%V 59
%N 1
%U http://geodesic.mathdoc.fr/item/CMJ_2009_59_1_a3/
%G en
%F 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/

[1] Chartrand, G., Eroh, L., Schultz, M., Zhang, P.: An introduction to analytic graph theory. Util. Math. 59 (2001), 31-55. | MR | Zbl

[2] Chartrand, G., Holbert, K. S., Oellermann, O. R., Swart, H. C.: $F$-Degrees in graphs. Ars Comb. 24 (1987), 133-148. | MR | Zbl

[3] Chartrand, G., Jarrett, E., Saba, F., Salehi, E., Zhang, P.: $F$-Continuous graphs. Czech. Math. J. 51 (2001), 351-361. | DOI | MR | Zbl

[4] Erdös, P., Sachs, H.: Reguläre Graphen gegebener Taillenweite mit minimaler Knotenzahl. Wiss Z. Martin-Luther-Univ. Halle-Wittenberg, Math.-Naturwiss. Reihe 12 (1963), 251-258 . | MR

[5] Gimbel, J., Zhang, P.: Degree-continuous graphs. Czech. Math. J. 51 (2001), 163-171. | MR | Zbl