✦ LIBER ✦

Computer generation of connected graphs

✍ Scribed by D.C. Rapaport

Book ID: 104109296
Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 53 KB
Volume: 35
Category: Article
ISSN: 0010-4655
DOI: 10.1016/s0010-4655(84)82511-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ D.C. Rapaport 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 536 KB

Computing connected components of simple

Computing connected components of simple undirected graphs based on generalized rough sets

✍ Jinkun Chen; Jinjin Li; Yaojin Lin 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 286 KB

Computer generation of vertex graphs

✍ N.S. Sridharan 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 870 KB

Computer generation of distance polynomi

Computer generation of distance polynomials of graphs

✍ K. Balasubramanian 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 582 KB

A computer program is developed to compute distance polynomials of graphs containing up to 200 vertices. The code also computes the eigenvalues and the eigenvectors of the distance matrix. It requires as input only the neighborhood information from which the program constructs the distance matrix. T

Generalized flowers ink-connected graphs

✍ A. Glazman 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 392 KB

Generating thec*5-connected graphs

✍ David Barnette 📂 Article 📅 1977 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 365 KB