Pages that link to "Item:Q2828965"

The following pages link to Lower bounds for algebraic connectivity of graphs in terms of matching number or edge covering number. (Q2828965):

Displaying 7 items.

• A lower bound for the algebraic connectivity of a graph in terms of the domination number (Q1617025) (← links)
• The algebraic connectivity of graphs with given matching number (Q2637744) (← links)
• Minimizing the algebraic connectivity of trees with given matching number (Q2811717) (← links)
• The algebraic connectivity of graphs with given stability number (Q4594673) (← links)
• Lower bounds for the algebraic connectivity of graphs with specified subgraphs (Q5061677) (← links)
• Hamiltonian graphs of given order and minimum algebraic connectivity (Q5206285) (← links)
• The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number (Q5892563) (← links)