Medha Itagi Huilgol

Products of distance degree regular and distance degree injective graphs.

Abstract The eccentricity e (u) of a vertex u is the maximum distance of u to any other vertex in G. The distance degree sequence (dds) of a vertex v in a graph G = (V, E) is a list of the number of vertices at distance 1, 2, …, e (u) in that order, where e (u) denotes the eccentricity of u in G. Thus the sequence is the dds of the vertex vi in G where denotes number of vertices at distance j from Vi . A graph is distance degree regular (DDR) graph if all vertices have the same dds. A graph is distance degree injective (DDI) graph if no two vertices have same dds. In this paper we consider Cartesian and normal products of DDR and DDI graphs. Some structural results have been obtained along with some characterizations.

On Some Edge Rotation Distance Graphs

The concept of edge rotations and distance between graphs was introduced by Gary Chartrand et.al (1).A graph G can be transformed into a graph H by an edge rotation if G contains distinct vertices u, v and w such

New results on edge rotation distance graphs

The concept of edge rotations and distance between graphs was introduced by Gary Chartrand et al. A graph

Products and Eccentric Diagraphs

G

DDR Graphs of Diameter Three

can be transformed into a graph

On Eccentric Digraphs of Graphs

H

Cyclic Edge Extensions - Self-centered Graphs

by an edge rotation if

Embedding in Distance Degree Regular and Distance Degree Injective graphs

G

Generalized Vertex Induced Connected Subsets of a Graph

contains distinct vertices

Edge Jump Distance Graphs

u