Add to ORKGPh.D.In this thesis, the ranks of many types of regular and strongly regular graphs are determined. Also determined are ranks of regular graphs under unary operations: the line graph, the complement, the subdivision graph, the connected cycle, the complete subdivision graph, and the total graph. The binary operations considered are the Cartesian product and the complete product. The ranks of the Cartesian product of regular graphs have been investigated previously in [BBD1]; here, we summarise and extend those results to include more regular graphs. We also examine a special nonregular graph, the path. Ranks of paths and products of graphs involving paths are presented as wel
Given a graph G, a function f: V (G) → {1, 2,..., k} is a k-ranking of G if f(u) = f(v) implies eve...
A k-ranking of a graph G is a colouring φ:V(G) → {1,...,k} such that any path in G with endvertices ...
A new operation on graphs is introduced and some of its properties are studied. We call it hierarchi...
Strongly regular graphs are certain very regular structures found in statistical design, finite grou...
A k-ranking of a directed graph G is a labeling of the vertex set of G with k positive integers such...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
Abstract. The Cartesian product of graphs was introduced more than 50 years ago and many fundamental...
Given a digraph D of order n, there is an associated square matrix of order n called its adjacency m...
summary:A $k$-ranking of a graph $G=(V,E)$ is a mapping $\varphi \:V \rightarrow \lbrace 1,2,\dots ,...
In this thesis we investigate two graph products called double vertex graphs and complete double ver...
AbstractThe concepts of lexical ordering and minimality of matrices are introduced and the connectio...
This is a survey of distance-regular graphs. We present an in-troduction to distance-regular graphs ...
AbstractThe question of when a given graph can be the underlying graph of a regular map has roots a ...
An exceptional graph is a connected graph with least eigenvalue greater than or equal to -2 which is...
For a graph G = ( V, E), a mapping C: V → 1,2, � k is a node ranking labeling if every path betwee...
Given a graph G, a function f: V (G) → {1, 2,..., k} is a k-ranking of G if f(u) = f(v) implies eve...
A k-ranking of a graph G is a colouring φ:V(G) → {1,...,k} such that any path in G with endvertices ...
A new operation on graphs is introduced and some of its properties are studied. We call it hierarchi...
Strongly regular graphs are certain very regular structures found in statistical design, finite grou...
A k-ranking of a directed graph G is a labeling of the vertex set of G with k positive integers such...
AbstractIn this paper we have tried to summarize the known results on strongly regular graphs. Both ...
Abstract. The Cartesian product of graphs was introduced more than 50 years ago and many fundamental...
Given a digraph D of order n, there is an associated square matrix of order n called its adjacency m...
summary:A $k$-ranking of a graph $G=(V,E)$ is a mapping $\varphi \:V \rightarrow \lbrace 1,2,\dots ,...
In this thesis we investigate two graph products called double vertex graphs and complete double ver...
AbstractThe concepts of lexical ordering and minimality of matrices are introduced and the connectio...
This is a survey of distance-regular graphs. We present an in-troduction to distance-regular graphs ...
AbstractThe question of when a given graph can be the underlying graph of a regular map has roots a ...
An exceptional graph is a connected graph with least eigenvalue greater than or equal to -2 which is...
For a graph G = ( V, E), a mapping C: V → 1,2, � k is a node ranking labeling if every path betwee...
Given a graph G, a function f: V (G) → {1, 2,..., k} is a k-ranking of G if f(u) = f(v) implies eve...
A k-ranking of a graph G is a colouring φ:V(G) → {1,...,k} such that any path in G with endvertices ...
A new operation on graphs is introduced and some of its properties are studied. We call it hierarchi...