𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by K. Balasubramanian

Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
624 KB
Volume
9
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

✦ Synopsis

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 signed graphs. This extension leads to a number of important applications of this code to several areas such as chemical kinetics, statistical mechanics, quantum chemistry of polymers, and unsaturated systems containing heteroatoms which include bond alternation. The characteristic polynomials of several edgeweighted graphs which may represent conjugated systems with bond alternations, heterographs (molecules with heteroatoms), directed graphs (chemical reaction network), and signed graphs and lattices are obtained for the first time.

πŸ“œ SIMILAR VOLUMES

Computational algorithms for matching po
Computational algorithms for matching polynomials of graphs from the characteristic polynomials of edge-weighted graphs
✍ Haruo Hosoya; K. Balasubramanian πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 736 KB

Computational algorithms are described which provide for constructing the set of associated edgeweighted directed graphs such that the average of the characteristic polynomials of the edge-weighted graphs gives the matching polynomial of the parent graph. The weights were chosen to be unities or pur

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

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

Computer generation of edge groups and e
Computer generation of edge groups and edge colorings of graphs
✍ Xiaoyu Liu; K. Balasubramanian πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 810 KB

A computer code and nonnumerical algorithm are developed to construct the edge group of a graph and to enumerate the edge colorings of graphs of chemical interest. The edge colorings of graphs have many applications in nuclear magnetic resonance (NMR), multiple quantum NMR, enumeration of structural

Circular colorings of edge-weighted grap
Circular colorings of edge-weighted graphs
✍ Bojan Mohar πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 99 KB

## Abstract The notion of (circular) colorings of edge‐weighted graphs is introduced. This notion generalizes the notion of (circular) colorings of graphs, the channel assignment problem, and several other optimization problems. For instance, its restriction to colorings of weighted complete graphs