Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
From MaRDI portal
Publication:2636822
DOI10.1016/j.dam.2013.09.012zbMath1283.05226OpenAlexW1978707241MaRDI QIDQ2636822
Publication date: 18 February 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.09.012
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (44)
On connected graphs of order \(n\) with girth \(g\) and nullity \(n-g\) ⋮ Characterization of graphs with given order, given size and given matching number that minimize nullity ⋮ Relation between the nullity of a graph and its matching number ⋮ The nullity of a graph with fractional matching number ⋮ Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices ⋮ Relation between the inertia indices of a complex unit gain graph and those of its underlying graph ⋮ On connected signed graphs with rank equal to girth ⋮ The rank of a signed graph ⋮ An upper bound of the nullity of a graph in terms of order and maximum degree ⋮ Bounds for the rank of a complex unit gain graph in terms of the independence number ⋮ Proof of a conjecture on the nullity of a connected graph in terms of order and maximum degree ⋮ Relations between the inertia indices of a mixed graph and those of its underlying graph ⋮ The rank of a complex unit gain graph in terms of the matching number ⋮ Nullities of graphs with given order, matching number and cyclomatic number revisited ⋮ On the relation between theH-rank of a mixed graph and the matching number of its underlying graph ⋮ The rank of a signed graph in terms of the rank of its underlying graph ⋮ Bounds for the matching number and cyclomatic number of a signed graph in terms of rank ⋮ Inertia indices of a complex unit gain graph in terms of matching number ⋮ The rank of a complex unit gain graph in terms of the rank of its underlying graph ⋮ Proof of a conjecture on the nullity of a graph ⋮ A survey of the maximal and the minimal nullity in terms of omega invariant on graphs ⋮ On the difference between the skew-rank of an oriented graph and the rank of its underlying graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An improved lower bound for the nullity of a graph in terms of matching number ⋮ A characterization of graphs \(G\) with nullity \(|V(G)|-2m(G)+2c(G)\) ⋮ Bounds for the rank of a complex unit gain graph in terms of its maximum degree ⋮ Relation between the \(H\)-rank of a mixed graph and the rank of its underlying graph ⋮ No signed graph with the nullity \(\eta(G,\sigma)=|V(G)|-2m(G)+2c(G)-1\) ⋮ Relationship between the rank and the matching number of a graph ⋮ No graph with nullity \(\eta(G) = | V(G) | - 2 m(G) + 2 c(G) - 1\) ⋮ The extremal graphs with respect to their nullity ⋮ Upper bounds of the energy of triangle-free graphs in terms of matching number ⋮ Nullity of a graph in terms of path cover number ⋮ Bounds on the nullity, the H-rank and the Hermitian energy of a mixed graph ⋮ An upper bound for the nullity of a bipartite graph in terms of its maximum degree ⋮ Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph ⋮ The leaf-free graphs with nullity \(2 c ( G ) - 1\) ⋮ The relation between the H-rank of a mixed graph and the independence number of its underlying graph ⋮ Graphs \(G\) with nullity \(2c(G) + p(G) - 1\) ⋮ The multiplicities of eigenvalues of a graph ⋮ The multiplicity of an arbitrary eigenvalue of a graph in terms of cyclomatic number and number of pendant vertices ⋮ A sharp upper bound of the nullity of a connected graph in terms of order and maximum degree ⋮ Skew-rank of an oriented graph in terms of the rank and dimension of cycle space of its underlying graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of graphs with rank 5
- A characterization of graphs with rank 4
- On the nullity of a graph with cut-points
- Spektren endlicher Grafen
- On the nullity and the matching number of unicyclic graphs
- The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear
- The rank of a graph after vertex addition
- On the construction of graphs of nullity one
- Trees with maximum nullity
- Chromatic number and the 2-rank of a graph
- On nut and core singular fullerenes
- A counterexample to the rank-coloring conjecture
- A Bound for the Chromatic Number of a Graph
- Rank and chromatic number of a graph
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of line graphs of trees
This page was built for publication: Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
