✦ LIBER ✦

From finite line graphs to infinite derived signed graphs

✍ Scribed by Vijayakumar, G.R.

Book ID: 122123318
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 389 KB
Volume: 453
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2014.03.047

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Uniquely Derived Generalized Line Graphs

Uniquely Derived Generalized Line Graphs and Uniquely Represented Signed Graphs with Least Eigenvalues\(\ge \)\(-2\)

✍ Vijayakumar, G. R. 📂 Article 📅 2014 🏛 Springer Japan 🌐 English ⚖ 202 KB

An extension of Sallee’s theorem to infi

An extension of Sallee’s theorem to infinite locally finite vap-free plane graphs

✍ Hwan-Ok Jung 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 216 KB

Numerical characterization of DNA sequen

Numerical characterization of DNA sequences: connectivity type indices derived from DNA line graphs

✍ R. Natarajan; R. Jayalakshmi; M. Vivekanandan 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 225 KB

Deriving simulation models from bond gra

Deriving simulation models from bond graphs with algebraic loops.: The extension to multibond graph systems

✍ R. Cacho; J. Felez; C. Vera 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Deriving a Graph Rewriting System from a

Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding

✍ Rom Langerak 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 989 KB

The starting point of this paper is McMillan's complete nite pre x of an unfolding that has been obtained from a Petri net or a process algebra expression. The paper addresses the question of how to obtain the (possibly in nite) system behaviour from the complete nite pre x. An algorithm is presente

How to calculate the number of perfect m

How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs

✍ Horst Sachs 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 341 KB