On graphs with isomorphic, non-isomorphic and connected -neighbourhoods
Zdeněk Ryjáček (1987)
Časopis pro pěstování matematiky
Similarity:
Displaying similar documents to “Graphs in which each pair of vertices has exactly two common neighbours”
On graphs with isomorphic, non-isomorphic and connected -neighbourhoods
A new upper bound on the total domination number of a graph.
Henning, Michael A., Yeo, Anders (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The graph of labellings of a given graph
Bohdan Zelinka (1988)
Mathematica Slovaca
Similarity:
On the Numbers of Cut-Vertices and End-Blocks in 4-Regular Graphs
Dingguo Wang, Erfang Shan (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A cut-vertex in a graph G is a vertex whose removal increases the number of connected components of G. An end-block of G is a block with a single cut-vertex. In this paper we establish upper bounds on the numbers of end-blocks and cut-vertices in a 4-regular graph G and claw-free 4-regular graphs. We characterize the extremal graphs achieving these bounds.