Bounds for the matching number and cyclomatic number of a signed graph in terms of rank
Linear Algebra and its Applications, 2019.
Abstract A signed graph ( G , σ ) is a graph with a sign attached to each of its edges, where G is the underlying graph of ( G , σ ) . Let m ( G ) , c ( G ) and r ( G , σ ) be the matching number, the cyclomatic number and the rank of the adjacency matrix of ( G , σ ) , respectiv...More
Full Text (Upload PDF)
PPT (Upload PPT)