𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Eigenvalues of the adjacency matrix of tetrahedral graphs

✍ Scribed by R. C. Bose; Renu Laskar

Publisher
Springer
Year
1970
Tongue
English
Weight
274 KB
Volume
4
Category
Article
ISSN
0001-9054

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Universal circuit matrix for adjacency g
Universal circuit matrix for adjacency graphs of feedback functions
✍ Jerzy Ε»urawiecki πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 267 KB

We define the class of undirected graphs associated with the feedback functions. Next, we construct a mapping which transforms a given feedback function into the circuit matrix of the corresponding graph. This mapping establishes some linear dependences between the nonlinear feedback functions, so i

Bounding the diameter and the mean dista
Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods
✍ J.A. RodrΓ­guez; J.L.A. Yebra πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 527 KB

Recently, several results bounding above the diameter and/or the mean distance of a graph from its eigenvalues have been presented. They use the eigenvalues of either the adjacency or the Laplacian matrix of the graph. The main object of this paper is to compare both methods. As expected, they are e

On the adjacency properties of paley gra
On the adjacency properties of paley graphs
✍ W. Ananchuen; L. Caccetta πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 614 KB

In the application of graph theory to problems arising in network design, the requirements of the network can be expressed in terms of restrictions on the values of certain graph parameters such as connectivity, edge-connectivity, diameter, and independence number. In this paper, we focus on network