Ela a Characterization of Singular Graphs
نویسندگان
چکیده
Characterization of singular graphs can be reduced to the non-trivial solutions of a system of linear homogeneous equations Ax = 0 for the 0-1 adjacency matrix A. A graph G is singular of nullity η(G) ≥ 1, if the dimension of the nullspace ker(A) of its adjacency matrix A is η(G). Necessary and sufficient conditions are determined for a graph to be singular in terms of admissible induced subgraphs.
منابع مشابه
Ela on the Characterization of Graphs with Pendent Vertices and given Nullity∗
Let G be a graph with n vertices. The nullity of G, denoted by η(G), is the multiplicity of the eigenvalue zero in its spectrum. In this paper, we characterize the graphs (resp. bipartite graphs) with pendent vertices and nullity η, where 0 < η ≤ n. Moreover, the minimum (resp. maximum) number of edges for all (connected) graphs with pendent vertices and nullity η are determined, and the extrem...
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملEla Characterization of Classes of Singular Linear Differential-algebraic Equations∗
Linear, possibly overor underdetermined, differential-algebraic equations are studied that have the same solution behavior as linear differential-algebraic equations with well-defined strangeness index. In particular, three different characterizations are given for differential-algebraic equations, namely by means of solution spaces, canonical forms, and derivative arrays. Two levels of general...
متن کاملA characterization of singular graphs
Characterization of singular graphs can be reduced to the non-trivial solutions of a system of linear homogeneous equations Ax = 0 for the 0-1 adjacency matrix A. A graph G is singular of nullity η(G) ≥ 1, if the dimension of the nullspace ker(A) of its adjacency matrix A is η(G). Necessary and sufficient conditions are determined for a graph to be singular in terms of admissible induced subgra...
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کامل