A recursion relation for the characteristic polynomial φ(G) of a molecular graph G is obtained, by means of which φ(G) is expressed as a linear combination of characteristic polynomials of certain edge- and vertex-deleted subgraphs of G. This result is a proper generalization of the long-known Heilbronner formula. The new recursion relation is extended to graphs with weighted edges and/or self-loops as well as to other polynomials of importance in chemical graph theory.
Description
A New Recursion Relation for the Characteristic Polynomial of a Molecular Graph - Journal of Chemical Information and Modeling (ACS Publications)
%0 Journal Article
%1 rosenfeld96
%A Rosenfeld, Vladimir R.
%A Gutman, Ivan
%D 1996
%J Journal of Chemical Information and Computer Sciences
%K characteristic graph.theory polynomial recurrence
%N 3
%P 527--530
%R 10.1021/ci9501148
%T A New Recursion Relation for the Characteristic Polynomial of a Molecular Graph
%U http://dx.doi.org/10.1021/ci9501148
%V 36
%X A recursion relation for the characteristic polynomial φ(G) of a molecular graph G is obtained, by means of which φ(G) is expressed as a linear combination of characteristic polynomials of certain edge- and vertex-deleted subgraphs of G. This result is a proper generalization of the long-known Heilbronner formula. The new recursion relation is extended to graphs with weighted edges and/or self-loops as well as to other polynomials of importance in chemical graph theory.
@article{rosenfeld96,
abstract = { A recursion relation for the characteristic polynomial φ(G) of a molecular graph G is obtained, by means of which φ(G) is expressed as a linear combination of characteristic polynomials of certain edge- and vertex-deleted subgraphs of G. This result is a proper generalization of the long-known Heilbronner formula. The new recursion relation is extended to graphs with weighted edges and/or self-loops as well as to other polynomials of importance in chemical graph theory. },
added-at = {2016-12-27T17:39:10.000+0100},
author = {Rosenfeld, Vladimir R. and Gutman, Ivan},
biburl = {https://www.bibsonomy.org/bibtex/2622611ea0ecafc716cf616d68bd0bb6a/ytyoun},
description = {A New Recursion Relation for the Characteristic Polynomial of a Molecular Graph - Journal of Chemical Information and Modeling (ACS Publications)},
doi = {10.1021/ci9501148},
eprint = {http://dx.doi.org/10.1021/ci9501148},
interhash = {7463c0f9bb403cbcab1ae6d96d2c5f24},
intrahash = {622611ea0ecafc716cf616d68bd0bb6a},
journal = {Journal of Chemical Information and Computer Sciences},
keywords = {characteristic graph.theory polynomial recurrence},
number = 3,
pages = {527--530},
timestamp = {2017-03-14T22:56:59.000+0100},
title = {A New Recursion Relation for the Characteristic Polynomial of a Molecular Graph},
url = {http://dx.doi.org/10.1021/ci9501148},
volume = 36,
year = 1996
}