Let G be a digraph with n vertices and A(G) be its adjacency matrix. A monic polynomialf(x) of degree at most n is called an annihilating polynomial of G iff(A(G)) = O. G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. In this paper, we give the explicit express
A note on the circuit polynomials and characteristic polynomials of wheels and ladders
โ Scribed by E.J. Farrell
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 547 KB
- Volume
- 39
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## dedicated to professor w. t. tutte on the occasion of his eightieth birtday It is known that the chromatic number of a graph G=(V, E) with V= [1, 2, ..., n] exceeds k iff the graph polynomial f G => ij # E, i<j (x i &x j ) lies in certain ideals. We describe a short proof of this result, using
A NOTE ON EXPONENTIAL POLYNOMIALS AND PRIME FACTORS by ROD MCBETH in London (England) Let p,, p 2 , p 3 , . . . denote the progression 2 , 3 , 5 , . . . of primes. The polynomials f of the class EP given in [l] can be correlated with functions p ( f ; -) which are based on the above progression. The