z-logo
Premium
The graph center concept for polycyclic graphs
Author(s) -
Bonchev Danail,
Balaban Alexandru T.,
Randić Milan
Publication year - 1981
Publication title -
international journal of quantum chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.484
H-Index - 105
eISSN - 1097-461X
pISSN - 0020-7608
DOI - 10.1002/qua.560190107
Subject(s) - vertex (graph theory) , combinatorics , graph , symmetric graph , regular graph , mathematics , computer science , discrete mathematics , line graph , voltage graph
Abstract While the concept of the graph center is unambiguous (and quite old) in the case of acyclic graphs, an attempt has been made recently to extend the concept to polycyclic structures using the distance matrix of a graph as the basis. In this work we continue exploring such generalizations considering in addition to the distance matrix, self‐avoiding walks or paths as graph invariants of potential interest for discriminating distinctive vertex environments in a graph of polycyclic structures. A hierachy of criteria is suggested that offers a systematic approach to the vertex discrimination and eventually establishes in most cases the graph center as a single vertex, a single bond (edge), or a single group of equivalent vertices. Some applications and the significance of the concept of the graph center are presented.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here