Geodetic line, middle and total graphs
Jerzy Topp (1990)
Mathematica Slovaca
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 “On partially directed geodetic graphs”
Geodetic line, middle and total graphs
Graphs related to diameter and center.
Gliviak, Ferdinand, Kyš, P. (1997)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Partially directed Moore graphs
Juraj Bosák (1979)
Mathematica Slovaca
Similarity:
Path-Neighborhood Graphs
R.C. Laskar, Henry Martyn Mulder (2013)
Discussiones Mathematicae Graph Theory
Similarity:
A path-neighborhood graph is a connected graph in which every neighborhood induces a path. In the main results the 3-sun-free path-neighborhood graphs are characterized. The 3-sun is obtained from a 6-cycle by adding three chords between the three pairs of vertices at distance 2. A Pk-graph is a path-neighborhood graph in which every neighborhood is a Pk, where Pk is the path on k vertices. The Pk-graphs are characterized for k ≤ 4.