Results 111 to 120 of about 7,067 (209)
Algebraic methods for chromatic polynomials [PDF]
, 2003 The chromatic polynomials of certain families of graphs can be calculated by a transfer matrix method. The transfer matrix commutes with an action of the symmetric group on the colours.
Reinfeld, Philipp Augustin
core
The Go polynomials of a graph [PDF]
, 2020 This paper introduces graph polynomials based on a concept from the game of Go. Suppose that, for each vertex of a graph, we either leave it uncoloured or choose a colour uniformly at random from a set of available colours, with the choices for the ...
G E Farr
core
The Arithmetic of Graph Polynomials [PDF]
, 2018 We investigate three graph polynomials including antimagic, super edge-magic, and chromatic polynomials. The Antimagic Graph Conjecture asserts that every connected graph $G = (V,E)$ except $K_2$ admits an edge labeling such that each label $1,2,\ldots ...
Farahmand Asil, Maryam
core
Generalized characteristic polynomials of graph bundles
, 2008 In this paper, we find computational formulae for generalized characteristic polynomials of graph bundles. We show that the number of spanning trees in a graph is the partial derivative (at (0,1)) of the generalized characteristic polynomial of the graph.
Kim, Dongseok +2 more
core +1 more source
Tutte Polynomial of Multi-Bridge Graphs [PDF]
Computer Science Journal of Moldova, 2013 In this paper, using a well-known recursion for computing the Tutte polynomial of any graph, we found explicit formulae for the Tutte polynomials of any multi-bridge graph and some $2-$tree graphs.
Julian A. Allagan
doaj
Hosoya polynomial of the subdivided join
Kuwait Journal of Science, 2019 The Hosoya polynomials of diameter 1 and diameter 2 graphs are known. We extend the concept of a vertex join of a graph to q-vertex join. Then we give the formula of the Hosoya polynomial of a $q$-vertex join of a complete graph and the formula of the ...
Eunice Gogo Mphako-Banda +1 more
doaj
Some inequalities for the Tutte polynomial
, 2011 This is the post-print version of the Article. The official published version can be accessed from the link below - Copyright @ 2011 ElsevierWe prove that the Tutte polynomial of a coloopless paving matroid is convex along the portion of the line x+y=p ...
Noble, Steven D. +15 more
core +1 more source
Linear Recurrence Relations for Graph Polynomials
, 2008 on the occasion of his 85th birthday. Abstract. A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving addition of vertices and ...
Johann A. Makowsky, Eldar Fischer
core
The polynomial of a directed graph [PDF]
Proceedings of the American Mathematical Society, 1965 Hoffman, A. J., McAndrew, M. H.
openaire +1 more source
On Almost Distance-Regular Graphs
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graph;walk-regular graph;eigenvalues;predistance ...
Fiol, M.A. +4 more
core