Add to ORKGThis paper discusses the singularity and nonsingularity of some special classes of graphs. These classes of graphs are paths, cycles, fans, and complete graphs. Some of the theorems discussed were taken from the doctoral dissertation of H. Rara which is entitled Singular and Nonsingular Graphs . However, some of the proofs were modified
We study those trees whose line graphs are singular. Besides new proofs of some old results, we offe...
AbstractThe concepts of causality and singularity for bond graphs are defined, and related through t...
Abstract. A simple graph G is a graceful graph if there exists a graceful labeling of the vertices o...
This paper discusses the singularity and nonsingularity of some special classes of graphs. These cla...
Given a digraph D of order n, there is an associated square matrix of order n called its adjacency m...
This thesis presents the different orientations of some special classes of digraphs, specifically or...
Abstract: A simple graph is said to be non-singular if its adjacency matrix is non-singular. In this...
A graph is said to be singular if the determinant of its adjacency matrix is equal to zero. Otherwis...
This paper discusses the singularity and nonsingularity of two special types of digraphs. These digr...
AbstractFor acyclic and unicyclic graphs we determine a necessary and sufficient condition for a gra...
AbstractThis paper studies singular graphs by considering minimal singular induced subgraphs of smal...
This survey attempts to describe the world of special graph classes with emphasis on special perfect...
A singular graph G, defined when its adjacency matrix is singular, has important applications in mat...
Ph.D.In this thesis, the ranks of many types of regular and strongly regular graphs are determined. ...
This paper is an exposition of the Singular graphs: The Cartesian Product of Two Graphs, from the st...
We study those trees whose line graphs are singular. Besides new proofs of some old results, we offe...
AbstractThe concepts of causality and singularity for bond graphs are defined, and related through t...
Abstract. A simple graph G is a graceful graph if there exists a graceful labeling of the vertices o...
This paper discusses the singularity and nonsingularity of some special classes of graphs. These cla...
Given a digraph D of order n, there is an associated square matrix of order n called its adjacency m...
This thesis presents the different orientations of some special classes of digraphs, specifically or...
Abstract: A simple graph is said to be non-singular if its adjacency matrix is non-singular. In this...
A graph is said to be singular if the determinant of its adjacency matrix is equal to zero. Otherwis...
This paper discusses the singularity and nonsingularity of two special types of digraphs. These digr...
AbstractFor acyclic and unicyclic graphs we determine a necessary and sufficient condition for a gra...
AbstractThis paper studies singular graphs by considering minimal singular induced subgraphs of smal...
This survey attempts to describe the world of special graph classes with emphasis on special perfect...
A singular graph G, defined when its adjacency matrix is singular, has important applications in mat...
Ph.D.In this thesis, the ranks of many types of regular and strongly regular graphs are determined. ...
This paper is an exposition of the Singular graphs: The Cartesian Product of Two Graphs, from the st...
We study those trees whose line graphs are singular. Besides new proofs of some old results, we offe...
AbstractThe concepts of causality and singularity for bond graphs are defined, and related through t...
Abstract. A simple graph G is a graceful graph if there exists a graceful labeling of the vertices o...