Graph labeling where vertices and edges are assigned values subject to certain conditions have been motivated by various applied mathematical fields. Most of the problems in graph labeling are discussed on undirected graphs. Bloom G.S. and Hsu D.F. defined the labeling on directed graphs. In this paper, we discuss the adjacency matrices of graceful digraphs such as unidirectional paths,alternating paths,many orientations of directed star and a class of directed bistar. We also discuss the adjacency matrices of unidirectional paths and alternating paths if they are odd digraceful
AbstractAn oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of ...
We introduce the concept of adjacency labeling schemes and recent results in the area. These schemes...
When a graceful labeling of a bipartite graph places the smaller labels in one of the stable sets of...
This thesis presents the different orientations of some special classes of digraphs, specifically or...
Given a digraph D of order n, there is an associated square matrix of order n called its adjacency m...
For a directed or undirected graph without loops we give formulae for the determinant and adjugate o...
In this paper we introduce a new graph matrix, named the anti-adjacency matrix or eccentricity matri...
Recently there is huge interest in graph theory and intensive study on computing integer powers of m...
AbstractWe study graphs whose adjacency matrices have determinant equal to 1 or −1, and characterize...
Graph labeling is an assignment of integers to the vertices and/or edges of a graph, subject to cert...
AbstractIf G denotes a graph of order n, then the adjacency matrix of an orientation G→ of G can be ...
AbstractThe study of the relationship between graph theoretic properties and spectral properties of ...
In this article we establish relationships between Leavitt path algebras, talented monoids and the a...
In the theory of line graphs of undirected graphs there exists an important theorem linking the inci...
A graph with m edges is defined to be graceful if its vertices can be labeled using the integers 0,1...
AbstractAn oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of ...
We introduce the concept of adjacency labeling schemes and recent results in the area. These schemes...
When a graceful labeling of a bipartite graph places the smaller labels in one of the stable sets of...
This thesis presents the different orientations of some special classes of digraphs, specifically or...
Given a digraph D of order n, there is an associated square matrix of order n called its adjacency m...
For a directed or undirected graph without loops we give formulae for the determinant and adjugate o...
In this paper we introduce a new graph matrix, named the anti-adjacency matrix or eccentricity matri...
Recently there is huge interest in graph theory and intensive study on computing integer powers of m...
AbstractWe study graphs whose adjacency matrices have determinant equal to 1 or −1, and characterize...
Graph labeling is an assignment of integers to the vertices and/or edges of a graph, subject to cert...
AbstractIf G denotes a graph of order n, then the adjacency matrix of an orientation G→ of G can be ...
AbstractThe study of the relationship between graph theoretic properties and spectral properties of ...
In this article we establish relationships between Leavitt path algebras, talented monoids and the a...
In the theory of line graphs of undirected graphs there exists an important theorem linking the inci...
A graph with m edges is defined to be graceful if its vertices can be labeled using the integers 0,1...
AbstractAn oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of ...
We introduce the concept of adjacency labeling schemes and recent results in the area. These schemes...
When a graceful labeling of a bipartite graph places the smaller labels in one of the stable sets of...