Article
Licensed
Unlicensed
Requires Authentication
On characteristic polynomials of periodic graphs
-
V. A. Kolmykov
Published/Copyright:
August 1, 2004
We consider periodic graphs of two types, chain and cyclic extension of an arbitrary graph. We give formulas which express the characteristic polynomials of such constructions in terms of the polynomials of the initial graphs, their subgraphs and the polynomials of a chain and a cycle. We present some applications of these results.
Published Online: 2004-08-01
Published in Print: 2004-08-01
Copyright 2004, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Limit theorems for sizes of trees in the unlabelled graph of a random mapping
- The limit distribution of the number of cyclic vertices in a random mapping in a special case
- The joint distribution of the number of ones and the number of 1-runs in binary Markov sequences
- Polynomial transformations of GEO-rings of prime characteristic
- On optimal exact coverings of a graph in the class of weakly dense bases
- On a generalisation of the method of boundary functionals
- On characteristic polynomials of periodic graphs
Articles in the same Issue
- Limit theorems for sizes of trees in the unlabelled graph of a random mapping
- The limit distribution of the number of cyclic vertices in a random mapping in a special case
- The joint distribution of the number of ones and the number of 1-runs in binary Markov sequences
- Polynomial transformations of GEO-rings of prime characteristic
- On optimal exact coverings of a graph in the class of weakly dense bases
- On a generalisation of the method of boundary functionals
- On characteristic polynomials of periodic graphs
