Displaying similar documents to “A remark on graph operators”

Graphs with the same peripheral and center eccentric vertices

Peter Kyš (2000)

Mathematica Bohemica

Similarity:

The eccentricity e ( v ) of a vertex v is the distance from v to a vertex farthest from v , and u is an eccentric vertex for v if its distance from v is d ( u , v ) = e ( v ) . A vertex of maximum eccentricity in a graph G is called peripheral, and the set of all such vertices is the peripherian, denoted P e r i G ) . We use C e p ( G ) to denote the set of eccentric vertices of vertices in C ( G ) . A graph G is called an S-graph if C e p ( G ) = P e r i ( G ) . In this paper we characterize S-graphs with diameters less or equal to four, give some constructions of...

The edge C₄ graph of some graph classes

Manju K. Menon, A. Vijayakumar (2010)

Discussiones Mathematicae Graph Theory

Similarity:

The edge C₄ graph of a graph G, E₄(G) is a graph whose vertices are the edges of G and two vertices in E₄(G) are adjacent if the corresponding edges in G are either incident or are opposite edges of some C₄. In this paper, we show that there exist infinitely many pairs of non isomorphic graphs whose edge C₄ graphs are isomorphic. We study the relationship between the diameter, radius and domination number of G and those of E₄(G). It is shown that for any graph G without isolated vertices,...

Two classes of graphs related to extremal eccentricities

Ferdinand Gliviak (1997)

Mathematica Bohemica

Similarity:

A graph G is called an S -graph if its periphery P e r i ( G ) is equal to its center eccentric vertices C e p ( G ) . Further, a graph G is called a D -graph if P e r i ( G ) ∩ C e p ( G ) = ∅ . We describe S -graphs and D -graphs for small radius. Then, for a given graph H and natural numbers r ≥ 2 , n ≥ 2 , we construct an S -graph of radius r having n central vertices and containing H as an induced subgraph. We prove an analogous existence theorem for D -graphs, too. At the end, we give some properties of S -graphs and D -graphs.