On the construction of graphs of nullity one
From MaRDI portal
Publication:1381857
DOI10.1016/S0012-365X(97)00036-8zbMath0901.05069MaRDI QIDQ1381857
Publication date: 1 April 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (46)
On 12-regular nut graphs ⋮ On the nullity and the matching number of unicyclic graphs ⋮ Minimal configuration trees ⋮ The nullity ofk-cyclic graphs of ∞-type ⋮ Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank ⋮ On singular signed graphs with nullspace spanned by a full vector: signed nut graphs ⋮ Fast algorithms for indices of nested split graphs approximating real complex networks ⋮ On circulant nut graphs ⋮ Nonsingular (vertex-weighted) block graphs ⋮ A characterization of long graphs of arbitrary rank ⋮ Positive and negative inertia index of a graph ⋮ The characterization of the minimal weighted acyclic graphs ⋮ On the spectrum of threshold graphs ⋮ The nullity of \((k-1)\)-cyclic graphs ⋮ A characterization of graphs with rank 5 ⋮ A characterization of graphs with rank 4 ⋮ Existence of regular nut graphs and the fowler construction ⋮ On the nullity of a graph with cut-points ⋮ Singular distance powers of circuits ⋮ \(\lambda\)-core distance partitions ⋮ Nullspace vertex partition in graphs ⋮ On the nullity of bicyclic graphs ⋮ On the nullity of graphs with pendent vertices ⋮ On nut and core singular fullerenes ⋮ Minimal configuration bicyclic graphs ⋮ Nowhere-zero eigenvectors of graphs ⋮ Graphs with a common eigenvalue deck ⋮ Tree decomposition by eigenvectors ⋮ On the multiplicity of \(\alpha\) as an eigenvalue of \(A_\alpha(G)\) of graphs with pendant vertices ⋮ On the nullity of bipartite graphs ⋮ Maximal and extremal singular graphs ⋮ No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\) ⋮ Minimal configuration unicyclic graphs ⋮ On the nullity of graphs with pendant trees ⋮ Nullity of a graph in terms of path cover number ⋮ Existence of regular nut graphs for degree at most 11 ⋮ Characterization of sub-long graphs of arbitrary rank ⋮ The conductivity of superimposed key-graphs with a common one-dimensional adjacency nullspace ⋮ Coalescing Fiedler and core vertices ⋮ The real symmetric matrices of odd order with a P-set of maximum size ⋮ On the nullity of unicyclic graphs ⋮ A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree ⋮ Complete characterization of bicyclic minimal configurations ⋮ On the nullity number of graphs ⋮ The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5 ⋮ On the rank spread of graphs
Cites Work
This page was built for publication: On the construction of graphs of nullity one
