A note on neighbour-distinguishing regular graphs total-weighting.
Przybylo, Jakub (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Irregularity strength of regular graphs.”
A note on neighbour-distinguishing regular graphs total-weighting.
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:
-free graphs of large minimum degree.
Alon, Noga, Sudakov, Benny (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Regular Graphs, Each Edge of Which Belongs to Exactly One -Gon
Anton Kotzig, Bohdan Zelinka (1970)
Matematický časopis
Similarity:
On graphs containing many subgraphs with the same number of edges
Jozef Širáň (1980)
Mathematica Slovaca
Similarity:
Edge neighbourhood graphs
Bohdan Zelinka (1986)
Czechoslovak Mathematical Journal
Similarity:
Weak Saturation Numbers for Sparse Graphs
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson (2013)
Discussiones Mathematicae Graph Theory
Similarity:
For a fixed graph F, a graph G is F-saturated if there is no copy of F in G, but for any edge e ∉ G, there is a copy of F in G + e. The minimum number of edges in an F-saturated graph of order n will be denoted by sat(n, F). A graph G is weakly F-saturated if there is an ordering of the missing edges of G so that if they are added one at a time, each edge added creates a new copy of F. The minimum size of a weakly F-saturated graph G of order n will be denoted by wsat(n, F). The graphs...