✦ LIBER ✦

Generalized characteristic polynomials of graph bundles

✍ Scribed by Dongseok Kim; Hye Kyung Kim; Jaeun Lee

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 143 KB
Volume: 429
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.03.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characteristic polynomials of some graph

Characteristic polynomials of some graph coverings

✍ Hirobumi Mizuno; Iwao Sato 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Graphs determined by their generalized c

Graphs determined by their generalized characteristic polynomials

✍ Wei Wang; Feng Li; Hongliang Lu; Zongben Xu 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 253 KB

Computer generation of the characteristi

Computer generation of the characteristic polynomials of chemical graphs

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

A computer program based on the Frame method for the characteristic polynomials of graphs is developed. This program makes use of an efficient polynomial algorithm of Frame for generating the coefficients in the characteristic polynomials of graphs. This program requires as input only the set of ver

The generating polynomial and Euler char

The generating polynomial and Euler characteristic of intersection graphs

✍ Yeong-Nan Yeh 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 580 KB

Let E" be n-dimensional Euclidean space. A molecular space is a family of unit cubes in E". Any molecular space can be represented by its intersection graph. Conversely, it is known that any graph G can be represented by molecular space M(G) in E" for some n. Suppose that S, and S, are topologically

Computer generation of characteristic po

Computer generation of characteristic polynomials of edge-weighted graphs, heterographs, and directed graphs

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

The computer code developed previously (K. Balasubramanian, J . Computational Chern., 5,387 (1984)) for the characteristic polynomials of ordinary (nonweighted) graphs is extended in this investigation to edge-weighted graphs, heterographs (vertex-weighted), graphs with loops, directed graphs, and s

Method for construction of characteristi

Method for construction of characteristic polynomials via graph linearization

✍ Kakali Datta; Asok K. Mukherjee 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 1 views

A new method for construction of characteristic polynomials CP of complicated graphs having arbitrary edge and vertex weights has been developed. The method first converts the graph into isospectral linear chains with weighted vertices and edges and then builds up the CP coefficients recursively. Tw