AbstractLet S be a set of graphs and d a distance function defined on S × S. The distance graph D(S) of S is that graph whose vertex set is S, and in which two vertices G and H are adjacent if and only if d(G, H) = 1. In this paper, we define two types of distance between graphs and discuss properties of the corresponding distance graphs. We also investigate those graphs that are distance graphs
Graphs have powerful representations of all kinds of theoretical or experimental mathematical object...
Graphs have powerful representations of all kinds of theoretical or experimental mathematical object...
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...
AbstractLet S be a set of graphs and d a distance function defined on S × S. The distance graph D(S)...
AbstractWe investigate three metrics on the isomorphism classes of graphs derived from elementary ed...
The concept of edge rotations and distance between graphs was introduced by Gary Chartrand et al....
We investigate three metrics on the isomorphism classes of graphs derived from elementary edge opera...
AbstractWe investigate three metrics on the isomorphism classes of graphs derived from elementary ed...
Thesis (M.Sc.)-University of Natal, 1991.Aspects of the fundamental concept of distance are investig...
The orientation distance graph ₒ(G) of a graph G is defined as the graph whose vertex set is the pai...
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...
A graph is a set of vertices (points) and edges (lines) connecting some of the vertices to each othe...
For a collection of graphs G, the distance graph of G is defined to be the graph containing a vertex...
AbstractLet (x, y) be an edge of a graph G. Then the rotation of (x, y) about x is the operation of ...
Graphs have powerful representations of all kinds of theoretical or experimental mathematical object...
Graphs have powerful representations of all kinds of theoretical or experimental mathematical object...
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...
AbstractLet S be a set of graphs and d a distance function defined on S × S. The distance graph D(S)...
AbstractWe investigate three metrics on the isomorphism classes of graphs derived from elementary ed...
The concept of edge rotations and distance between graphs was introduced by Gary Chartrand et al....
We investigate three metrics on the isomorphism classes of graphs derived from elementary edge opera...
AbstractWe investigate three metrics on the isomorphism classes of graphs derived from elementary ed...
Thesis (M.Sc.)-University of Natal, 1991.Aspects of the fundamental concept of distance are investig...
The orientation distance graph ₒ(G) of a graph G is defined as the graph whose vertex set is the pai...
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...
A graph is a set of vertices (points) and edges (lines) connecting some of the vertices to each othe...
For a collection of graphs G, the distance graph of G is defined to be the graph containing a vertex...
AbstractLet (x, y) be an edge of a graph G. Then the rotation of (x, y) about x is the operation of ...
Graphs have powerful representations of all kinds of theoretical or experimental mathematical object...
Graphs have powerful representations of all kinds of theoretical or experimental mathematical object...
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...
DOI
Add to ORKG