Publication date
August 2009
DOIAbstract
A Smarandachely uniform 1-graph is abbreviated to a complementary distance pattern uniform graph, i.e., CDPU graphs. This paper studies independent CDPU graphs
A Smarandachely uniform 1-graph is abbreviated to a complementary distance pattern uniform graph, i.e., CDPU graphs. This paper studies independent CDPU graphs
This thesis is a detailed study about Distance-Regular Graphs having homogeneous edge patterns in ea...
In this paper we investigate the metric hierarchy for distance-regular graphs: in particular, we cla...
We introduce a variation of unit-distance graphs which we call emph clear unit-distance graphs. They...
AgraphG =(V,E) is called to be Smarandachely uniform k-graph for an integer k ≥ 1ifthereexistsM1,M2,...
All graphs considered in this paper are finite, simple, undirected and connected. For graph theoreti...
Abstract: Given an arbitrary non-empty subset M of vertices in a graph G = (V,E), each vertex u in G...
AbstractA graph G=(V,E) is called a unit-distance graph in the plane if there is an embedding of V i...
In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illus...
This chapter describes distances between isomorphism classes or distances between graphs. An isomorp...
This is a survey of distance-regular graphs. We present an in-troduction to distance-regular graphs ...
Let G=(V,E) be a connected simple graph and let M be a nonempty subset of V. The M-distance pattern ...
AbstractWe consider a distance-regular graph having homogeneous edge patterns in each entry of its i...
AbstractIn this paper we investigate the metric hierarchy for distance-regular graphs: in particular...
AbstractSupposeDis a subset ofZ. The distance graphG(Z,D) with distance setDis the graph with vertex...
A distance graph is an undirected graph on the integers where two integers are adjacent if their dif...
This thesis is a detailed study about Distance-Regular Graphs having homogeneous edge patterns in ea...
In this paper we investigate the metric hierarchy for distance-regular graphs: in particular, we cla...
We introduce a variation of unit-distance graphs which we call emph clear unit-distance graphs. They...
AgraphG =(V,E) is called to be Smarandachely uniform k-graph for an integer k ≥ 1ifthereexistsM1,M2,...
All graphs considered in this paper are finite, simple, undirected and connected. For graph theoreti...
Abstract: Given an arbitrary non-empty subset M of vertices in a graph G = (V,E), each vertex u in G...
AbstractA graph G=(V,E) is called a unit-distance graph in the plane if there is an embedding of V i...
In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illus...
This chapter describes distances between isomorphism classes or distances between graphs. An isomorp...
This is a survey of distance-regular graphs. We present an in-troduction to distance-regular graphs ...
Let G=(V,E) be a connected simple graph and let M be a nonempty subset of V. The M-distance pattern ...
AbstractWe consider a distance-regular graph having homogeneous edge patterns in each entry of its i...
AbstractIn this paper we investigate the metric hierarchy for distance-regular graphs: in particular...
AbstractSupposeDis a subset ofZ. The distance graphG(Z,D) with distance setDis the graph with vertex...
A distance graph is an undirected graph on the integers where two integers are adjacent if their dif...
This thesis is a detailed study about Distance-Regular Graphs having homogeneous edge patterns in ea...
In this paper we investigate the metric hierarchy for distance-regular graphs: in particular, we cla...
We introduce a variation of unit-distance graphs which we call emph clear unit-distance graphs. They...
Add to ORKG