On the Numbers of Cut-Vertices and End-Blocks in 4-Regular Graphs

Dingguo Wang; Erfang Shan

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “On the Numbers of Cut-Vertices and End-Blocks in 4-Regular Graphs”

Graphs in which each pair of vertices has exactly two common neighbours

Bohdan Zelinka (1993)

Mathematica Bohemica

Similarity:

The paper studies graphs in which each pair of vertices has exactly two common neighbours. It disproves a conjectury by P. Hliněný concerning these graphs.

On some regularities of graphs. I.

Jerzy Płonka (1982)

Časopis pro pěstování matematiky

Similarity:

Tight upper bounds for the domination numbers of graphs with given order and minimum degree.

Clark, W.Edwin, Dunning, Larry A. (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On isopart parameters of complete bipartite graphs and $n$ -cubes

Richard M. Davitt, John Frederick Fink, Michael S. Jacobson (1985)

Mathematica Slovaca

Similarity:

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:

Graphs with prescribed neighbourhood graphs

Bohdan Zelinka (1985)

Mathematica Slovaca

Similarity:

Displaying similar documents to “On the Numbers of Cut-Vertices and End-Blocks in 4-Regular Graphs”

Graphs in which each pair of vertices has exactly two common neighbours

On some regularities of graphs. I.

Tight upper bounds for the domination numbers of graphs with given order and minimum degree.

On isopart parameters of complete bipartite graphs and n -cubes

A new upper bound on the total domination number of a graph.

Graphs with prescribed neighbourhood graphs

On isopart parameters of complete bipartite graphs and $n$ -cubes