Trees with maximum nullity

DOI10.1016/J.LAA.2004.10.024MaRDI QIDQ1774973zbMATH OpenOpenAlexFDO

Authors Stanley Fiorini, Ivan Gutman, Irene Sciriha

Publication date 4 May 2005

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2004.10.024

zbMATH Keywords

eigenvaluesmaximal matchings

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• On the trees with maximum nullity
• Maximal trees
• Integral trees with given nullity
• Null decomposition of trees
• Trees with maximum general Randić index
• Trees with maximum exponential Randić index
• scientific article; zbMATH DE number 5904022
• Trees with maximum \(p\)-reinforcement number
• Trees with the maximal value of Graovac-Pisanski index
• Trees with maximum number of maximal matchings

Cited in

(60)

• An upper bound of the nullity of a graph in terms of order and maximum degree
• Null decomposition of trees
• A note on the nullity of unicyclic signed graphs
• Positive and negative inertia index of a graph
• The nullity of (k-1)-cyclic graphs
• The multiplicities of eigenvalues of a graph
• Nullity and singularity of a graph in which every block is a cycle
• A linear time algorithm for the nullity of vertex-weighted block graphs
• Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree
• On the multiplicity of an arbitrary \(A_\alpha\)-eigenvalue of a connected graph
• Nonsingular (vertex-weighted) block graphs
• On \((k+1)\)-line graphs of \(k\)-trees and their nullities
• Nullspace vertex partition in graphs
• On the nullity of a connected graph in terms of order and maximum degree
• The leaf-free graphs with nullity \(2 c ( G ) - 1\)
• The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
• On the null-spaces of acyclic and unicyclic singular graphs
• The positive and the negative inertia index of line graphs of trees
• On the nullity of unicyclic graphs
• On the nullity of a family of tripartite graphs
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• Characterization of graphs with given order, given size and given matching number that minimize nullity
• The signature of k-cyclic graphs of -type
• An upper bound for the nullity of a bipartite graph in terms of its maximum degree
• On the null-spaces of bicyclic singular graphs
• Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
• Characterization of graphs whose signature equals the number of odd cycles
• Minimizing the Laplacian spectral radius of trees with given matching number
• The nullity of \(k\)-cyclic graphs of \(\infty\)-type
• Minimal configuration unicyclic graphs
• A characterization of graphs with rank 5
• On the nullity of the line graph of unicyclic graph with depth one
• Minimal configuration bicyclic graphs
• Nullity of a graph in terms of path cover number
• On the nullity number of graphs
• On the multiplicity of \(-1\) as an eigenvalue of a tree with given number of pendant vertices
• The minimal Laplacian spectral radius of trees with given matching number
• The nullity of bicyclic signed graphs
• On the trees with maximum nullity
• On the nullity of bipartite graphs
• On the nullity of bipartite graphs
• On the nullity of graphs with pendant trees
• The extremal graphs with respect to their nullity
• On bounds of \(A_\alpha\)-eigenvalue multiplicity and the rank of a complex unit gain graph
• The characterization of the minimal weighted acyclic graphs
• Proof of a conjecture on the nullity of a graph
• Line graphs of trees with the largest eigenvalue multiplicity
• A characterization of graphs with rank 4
• On the nullity of tricyclic graphs
• On the nullity of a graph with cut-points
• A note proving the nullity of block graphs is unbounded
• Nullity of graphs -- a survey and some new results
• Existence of a non-zero (0, 1)-vector in the row space of adjacency matrices of simple graphs
• On the nullity of middle graphs
• Bounding the multiplicities of eigenvalues of graph matrices in terms of circuit rank
• On connected graphs of order n with girth g and nullity n-g
• On the nullity and the matching number of unicyclic graphs
• On the nullity of bicyclic graphs
• On the nullity of graphs with pendent vertices
• Tree decomposition by eigenvectors

This page was built for publication: Trees with maximum nullity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1774973)