✦ LIBER ✦

Bounds of Laplacian spectrum of graphs based on the domination number

✍ Scribed by Mei Lu; Huiqing Liu; Feng Tian

Book ID: 108198794
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 189 KB
Volume: 402
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2005.01.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds of the Laplacian spectrum o

Lower bounds of the Laplacian spectrum of graphs based on diameter

✍ Mei Lu; Lian-zhu Zhang; Feng Tian 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 125 KB

Bounds on the connected -domination numb

Bounds on the connected -domination number in graphs

✍ Adriana Hansberg 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 234 KB

Upper bounds for ƒ-domination number of

Upper bounds for ƒ-domination number of graphs

✍ Beifang Chen; Sanming Zhou 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Bounds on the -domination number of a gr

Bounds on the -domination number of a graph

✍ Ermelinda DeLaViña; Wayne Goddard; Michael A. Henning; Ryan Pepper; Emil R. Vaug 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 200 KB

The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove two bounds on the k-domination number of a graph, inspired by two conjectures of the computer program Graffiti.pc. In part

Bounds on the signed domination number o

Bounds on the signed domination number of a graph

✍ Ruth Haas; Thomas B. Wexler 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Bounds on the Distance Two-Domination Nu

Bounds on the Distance Two-Domination Number of a Graph

✍ N. Sridharan; V.S.A. Subramanian; M.D. Elias 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 122 KB