A lower bound for the algebraic connectivity of a graph in terms of the domination number

preprint2013arXivOpen access

Abstract

We investigate how the algebraic connectivity of a graph changes by relocating a connected branch from one vertex to another vertex, and then minimize the algebraic connectivity among all connected graphs of order nn with fixed domination number γ≤n+23γ\le \frac{n+2}{3}, and finally present a lower bound for the algebraic connectivity in terms of the domination number.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.