EUDML

Currently displaying 1 – 5 of 5

Order by Relevance | Title | Year of publication

Edge rotations and distance between graphs

Gary Chartrand; Farrokh Saba; Hung Bin Zou — 1985

Časopis pro pěstování matematiky

Greatest common subgraphs of graphs

Gary Chartrand; Farrokh Saba; Hung Bin Zou — 1987

Časopis pro pěstování matematiky

$F$ -continuous graphs

Gary Chartrand; Elzbieta B. Jarrett; Farrokh Saba; Ebrahim Salehi; Ping Zhang — 2001

Czechoslovak Mathematical Journal

For a nontrivial connected graph $F$ , the $F$ -degree of a vertex $v$ in a graph $G$ is the number of copies of $F$ in $G$ containing $v$ . 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 $P_{3}$ -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...