Graphs \(G\) with nullity \(2c(G) + p(G) - 1\)

DOI10.1016/J.DAM.2022.01.008zbMath1483.05092OpenAlexW4210725000MaRDI QIDQ2078839

Jian Xi Li, Sarula Chang, Yirong Zheng, Bit-Shun Tam

Publication date: 4 March 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.01.008

zbMATH Keywords

cyclomatic numbernullity of a graphmatched vertexmaximal pendant treependant \(K_2\) deletionpendant subgraph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (10)

On connected signed graphs with rank equal to girth ⋮ Nullities of cycle-spliced bipartite graphs ⋮ Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices ⋮ On connected \(\mathbb{T}\)-gain graphs with rank equal to girth ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A characterization for a graph with an eigenvalue of multiplicity \(2c(G)+p(G) - 1\) ⋮ Singularity of cycle-spliced signed graphs ⋮ The gap between the rank of a complex unit gain graph and its underlying graph ⋮ The eigenvalue multiplicity of line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Characterization of graphs with given order, given size and given matching number that minimize nullity
• Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices
• Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows
• A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\)
• On the nullity of a graph with cut-points
• On the nullity and the matching number of unicyclic graphs
• Interlacing eigenvalues and graphs
• Graph transformations which preserve the multiplicity of an eigenvalue
• Positive and negative inertia index of a graph
• No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\)
• The leaf-free graphs with nullity \(2 c ( G ) - 1\)
• Nullities of graphs with given order, matching number and cyclomatic number revisited
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• On the nullity of graphs with pendant trees
• The extremal graphs with respect to their nullity

This page was built for publication: Graphs \(G\) with nullity \(2c(G) + p(G) - 1\)