✦ LIBER ✦

On the construction of graphs of nullity one

✍ Scribed by Irene Sciriha

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 780 KB
Volume: 181
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00036-8

No coin nor oath required. For personal study only.

✦ Synopsis

This paper studies singular graphs by considering minimal singular induced subgraphs of small order. These correspond to a number k of linearly dependent rows of the adjacency matrix determining what is termed as a core of the singular graph. For k at most 5, the distinct cores and corresponding minimal configurations (61 in number) are identified. This provides a method of constructing singular graphs from others of smaller order. Furthermore, it is shown that when a graph has a minimal configuration as an induced subgraph, then it is singular.

📜 SIMILAR VOLUMES

On the nullity of tricyclic graphs

✍ Bo Cheng; Bolian Liu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 457 KB

The nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its spectrum. The extremal graphs attaining the upper bound n-2 and the second upper bound n-3 have been obtained. In this paper, the graphs with nullity n-4 are characterized. Furthermore the tricyclic graphs

On the nullity of bicyclic graphs

✍ Shengbiao Hu; Tan Xuezhong; Bolian Liu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 139 KB

On the nullity of unicyclic graphs

✍ Tan Xuezhong; Bolian Liu 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 271 KB

On the nullity of bipartite graphs

✍ Yi-Zheng Fan; Ke-Shi Qian 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 171 KB

On the nullity of graphs with pendent ve

On the nullity of graphs with pendent vertices

✍ Shuchao Li 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 188 KB

The nullity of a graph G, denoted by η(G), is the multiplicity of the eigenvalue zero in its spectrum. Cheng and Liu [B. Cheng, B. Liu, On the nullity of graphs, Electron. J. Linear Algebra 16 (2007) 60-67] characterized the extremal graphs attaining the upper bound n -2 and the second upper bound n

On the nullity of graphs with pendant tr

On the nullity of graphs with pendant trees

✍ Shi-Cai Gong; Yi-Zheng Fan; Zhi-Xiang Yin 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 151 KB