A note on neighbour-distinguishing regular graphs total-weighting.
Przybylo, Jakub (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
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: