All graphs considered in this paper are finite, simple, undirected and connected. For graph theoretic terminology we refer to Harary [6]. The concept of open distance-pattern and open distance-pattern uniform graphs weresuggested by B.D. Acharya
[EN] Using the general notion of distance function introduced in an earlier paper, a construction of...
For a collection of graphs G, the distance graph of G is defined to be the graph containing a vertex...
The distance matrix, which is a structure less common than the adjacency matrix [ l] , has been incr...
Abstract: Given an arbitrary non-empty subset M of vertices in a graph G = (V,E), each vertex u in G...
A Smarandachely uniform 1-graph is abbreviated to a complementary distance pattern uniform graph, i....
Abstract. Let be a connected graph with diameter , ,, , … , be a non-empty set of colors of...
Let G=(V,E) be a connected simple graph and let M be a nonempty subset of V. The M-distance pattern ...
One problem with the theory of distance-regular graphs is that it does not apply directly to the gra...
This is a survey of distance-regular graphs. We present an in-troduction to distance-regular graphs ...
AbstractThis paper studies model theoretic conditions that arise in the study of distanced graphs. T...
Given a connected simple (p, q)-graph G = (V,E) and ∅ = M ⊆ V, we initiate a study of the set-value...
AbstractFor a subset Y of the vertices of a distance-regular graph, we define a tight graph with res...
Abstract. The concept of distance is one of the basic concepts in Mathematics. How far two objects (...
AbstractThis paper describes some classes of infinite distance-transitive graphs. It has no pretensi...
A distance antimagic graph is a graph G admitting a bijection f:V(G)→{1,2,…,|V(G)|} such that for tw...
[EN] Using the general notion of distance function introduced in an earlier paper, a construction of...
For a collection of graphs G, the distance graph of G is defined to be the graph containing a vertex...
The distance matrix, which is a structure less common than the adjacency matrix [ l] , has been incr...
Abstract: Given an arbitrary non-empty subset M of vertices in a graph G = (V,E), each vertex u in G...
A Smarandachely uniform 1-graph is abbreviated to a complementary distance pattern uniform graph, i....
Abstract. Let be a connected graph with diameter , ,, , … , be a non-empty set of colors of...
Let G=(V,E) be a connected simple graph and let M be a nonempty subset of V. The M-distance pattern ...
One problem with the theory of distance-regular graphs is that it does not apply directly to the gra...
This is a survey of distance-regular graphs. We present an in-troduction to distance-regular graphs ...
AbstractThis paper studies model theoretic conditions that arise in the study of distanced graphs. T...
Given a connected simple (p, q)-graph G = (V,E) and ∅ = M ⊆ V, we initiate a study of the set-value...
AbstractFor a subset Y of the vertices of a distance-regular graph, we define a tight graph with res...
Abstract. The concept of distance is one of the basic concepts in Mathematics. How far two objects (...
AbstractThis paper describes some classes of infinite distance-transitive graphs. It has no pretensi...
A distance antimagic graph is a graph G admitting a bijection f:V(G)→{1,2,…,|V(G)|} such that for tw...
[EN] Using the general notion of distance function introduced in an earlier paper, a construction of...
For a collection of graphs G, the distance graph of G is defined to be the graph containing a vertex...
The distance matrix, which is a structure less common than the adjacency matrix [ l] , has been incr...
DOI
Add to ORKG