Pages that link to "Item:Q2332431"

The following pages link to The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices (Q2332431):

Displaying 12 items.

• On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\) (Q820992) (← links)
• Relation between the nullity of a graph and its matching number (Q833002) (← links)
• Graphs with nullity \(2c(G)+p(G)-1\) (Q2113337) (← links)
• Graphs with eigenvalue \(-1\) of multiplicity \(2 \theta (G)+ \rho (G) -1\) (Q2132509) (← links)
• Graphs \(G\) with nullity \(n(G) - g(G) -1\) (Q2133682) (← links)
• The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs (Q2185918) (← links)
• On the multiplicity of −1 as an eigenvalue of a tree with given number of pendant vertices (Q5049197) (← links)
• A characterization of trees with eigenvalue multiplicity one less than their number of pendant vertices (Q6197709) (← links)
• Eigenvalue multiplicity of graphs with given cyclomatic number and given number of quasi-pendant vertices (Q6202934) (← links)
• Eigenvalue multiplicity of a graph in terms of the number of external vertices (Q6541324) (← links)
• A characterization for a graph with an eigenvalue of multiplicity \(2c(G)+p(G) - 1\) (Q6542049) (← links)
• The eigenvalue multiplicity of line graphs (Q6635245) (← links)