✦ LIBER ✦

Adjacency matrix generation from the image of graphs: a morphological approach

✍ Scribed by Amit K. Das; Bhabatosh Chanda

Publisher: Springer-Verlag
Year: 1997
Tongue: English
Weight: 292 KB
Volume: 10
Category: Article
ISSN: 0932-8092
DOI: 10.1007/s001380050054

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the characteristic polynomial of the

On the characteristic polynomial of the adjacency matrix of the subdivision graph of a graph

✍ Shoji Shinoda 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 295 KB

A rearrangement of adjacency matrix base

A rearrangement of adjacency matrix based approach for solving the crossing minimization problem

✍ Neng Fan; Panos M. Pardalos 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 543 KB

Generation of the eigenvectors of the to

Generation of the eigenvectors of the topological matrix from graph theory

✍ Allen J. Kassman 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 330 KB

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

An Approach to Improving the Mayeda Meth

An Approach to Improving the Mayeda Method for Graph Realization from a Matrix

✍ J. Qian; P.-Y. Woo 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 500 KB

The gap between the chromatic number of

The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear

✍ A.A. Razborov 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 199 KB

The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear.