scientific article; zbMATH DE number 6100973

MaRDI QIDQ3166853zbMATH OpenFDO

Authors Li Su, Huixian Sun, Honghai Li

Publication date 1 November 2012

Full work available at URL http://www.math.technion.ac.il/iic/ela/ela-articles/articles/vol23_pp137-150.pdf

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

rankadjacency matrixdiameterbipartite graphsnullity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Recommendations

• On acyclic and unicyclic graphs whose minimum rank equals the diameter
• On a min--max theorem on bipartite graphs
• On the Kirchhoff index of bipartite graphs with given diameters
• On degree sets and the minimum orders in bipartite graphs
• Minimum \(k\)-critical bipartite graphs
• On the structure of minimally \(n\)-extendable bipartite graphs
• Range of diameters of a bipartite graph and its generalized 2-partite complement
• On bipartite graphs with minimal energy
• A characterization of the non-trivial diameter two graphs of minimum size
• P_m-saturated bipartite graphs with minimum size

Cited in

(16)

• Proof of a conjecture on the nullity of a graph
• Characterization of sub-long graphs of arbitrary rank
• On acyclic and unicyclic graphs whose minimum rank equals the diameter
• Characterization of graphs with given order, given size and given matching number that minimize nullity
• On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis
• On the nullity of the line graph of unicyclic graph with depth one
• An upper bound of the nullity of a graph in terms of order and maximum degree
• The positive and the negative inertia index of line graphs of trees
• The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices
• Line graphs of trees with the largest eigenvalue multiplicity
• Nullity of a graph in terms of path cover number
• A characterization of long graphs of arbitrary rank
• 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
• Maximum order of trees and bipartite graphs with a given rank
• An improved lower bound for the nullity of a graph in terms of matching number

This page was built for publication:

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