On the impossibility to construct diametrically critical graphs by extensions
Ferdinand Gliviak (1975)
Archivum Mathematicum
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On radially extremal graphs and digraphs, a survey”
On the impossibility to construct diametrically critical graphs by extensions
On minimal graphs of diameter with every edge in a -cycle
Ján Plesník (1986)
Mathematica Slovaca
Similarity:
Graphs of low chordality.
Chandran, L.Sunil, Lozin, Vadim V., Subramanian, C.R. (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Radio Graceful Hamming Graphs
Amanda Niedzialomski (2016)
Discussiones Mathematicae Graph Theory
Similarity:
For k ∈ ℤ+ and G a simple, connected graph, a k-radio labeling f : V (G) → ℤ+ of G requires all pairs of distinct vertices u and v to satisfy |f(u) − f(v)| ≥ k + 1 − d(u, v). We consider k-radio labelings of G when k = diam(G). In this setting, f is injective; if f is also surjective onto {1, 2, . . . , |V (G)|}, then f is a consecutive radio labeling. Graphs that can be labeled with such a labeling are called radio graceful. In this paper, we give two results on the existence of radio...