✦ LIBER ✦

Further results on controllable graphs

✍ Scribed by Stanić, Zoran

Book ID: 122310623
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 375 KB
Volume: 166
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.10.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Further Results on Bar k-Visibility Grap

Further Results on Bar k-Visibility Graphs

✍ Hartke, Stephen G.; Vandenbussche, Jennifer; Wenger, Paul 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 154 KB

Further results on hierarchical product

Further results on hierarchical product of graphs

✍ Tavakoli, M.; Rahbarnia, F.; Ashrafi, A.R. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 239 KB

Further results on graph equations for l

Further results on graph equations for line graphs and n-th power graphs

✍ Jin Akiyama; Hiroshi Era; Geoffrey Exoo 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 913 KB

Further Results on Set Sequential and Se

Further Results on Set Sequential and Set Graceful Graphs

✍ S.M. Hegde 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 253 KB

Further results on the least eigenvalue

Further results on the least eigenvalue of connected graphs

✍ Miroslav Petrović; Tatjana Aleksić; Slobodan Simić 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Further results on snakes in powers of c

Further results on snakes in powers of complete graphs

✍ H.L. Abbott; M. Katchalski 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 553 KB

Abbott, H.L. and M. Katchalski, Further results on snakes in powers of complete graphs, Discrete Mathematics 91 (1991) 111-120. By a snake in a finite graph G is meant a cycle without chords. Denoted by S(G) the length of a longest snake in G. In this paper we obtain a new lower bound for S(G) in t