DOIAbstract
AbstractFor acyclic and unicyclic graphs we determine a necessary and sufficient condition for a graph G to be singular. Further, it is shown that this characterization can be used to construct a basis for the null-space of G
AbstractFor acyclic and unicyclic graphs we determine a necessary and sufficient condition for a graph G to be singular. Further, it is shown that this characterization can be used to construct a basis for the null-space of G
This paper is an exposition of the Singular graphs: The Cartesian Product of Two Graphs, from the st...
AbstractA connected graph with a unique cycle is called a unicyclic graph. A unicyclic graph with de...
Given a digraph D of order n, there is an associated square matrix of order n called its adjacency m...
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...
Characterization of singular graphs can be reduced to the non-trivial solutions of a system of linea...
AbstractThe nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this p...
This paper discusses the singularity and nonsingularity of some special classes of graphs. These cla...
AbstractThe nullity of a graph is defined as the multiplicity of the eigenvalue zero in the spectrum...
A combinatorial notion of null-homotopy for graphs was introduced by Duchet, Las Vergnas, and Meynie...
We characterize unicyclic graphs that are singular using the support of the null space of their pend...
AbstractThe nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this p...
AbstractLet S be a singular graph. We study conditions on the vertices of S to extend Jordan chains ...
Let Γ be a simple graph on a finite vertex set V and let A be its adjacency matrix. Then Γ is said to...
AbstractThe nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its...
This paper is an exposition of the Singular graphs: The Cartesian Product of Two Graphs, from the st...
AbstractA connected graph with a unique cycle is called a unicyclic graph. A unicyclic graph with de...
Given a digraph D of order n, there is an associated square matrix of order n called its adjacency m...
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...
Characterization of singular graphs can be reduced to the non-trivial solutions of a system of linea...
AbstractThe nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this p...
This paper discusses the singularity and nonsingularity of some special classes of graphs. These cla...
AbstractThe nullity of a graph is defined as the multiplicity of the eigenvalue zero in the spectrum...
A combinatorial notion of null-homotopy for graphs was introduced by Duchet, Las Vergnas, and Meynie...
We characterize unicyclic graphs that are singular using the support of the null space of their pend...
AbstractThe nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this p...
AbstractLet S be a singular graph. We study conditions on the vertices of S to extend Jordan chains ...
Let Γ be a simple graph on a finite vertex set V and let A be its adjacency matrix. Then Γ is said to...
AbstractThe nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its...
This paper is an exposition of the Singular graphs: The Cartesian Product of Two Graphs, from the st...
AbstractA connected graph with a unique cycle is called a unicyclic graph. A unicyclic graph with de...
Given a digraph D of order n, there is an associated square matrix of order n called its adjacency m...
Add to ORKG