Results 71 to 80 of about 7,067 (209)
THE COMPLEXITY OF COMPUTING THE SIGN OF THE TUTTE POLYNOMIAL [PDF]
, 2014 (c) 2014 Society for Industrial and Applied ...
Jerrum, M, Goldberg, LA
core +1 more source
Homomorphism and sigma polynomials
International Journal of Mathematics and Mathematical Sciences, 1995 By establishing a connection between the sigma polynomial and the homomorphism polynomial, many of the proofs for computing the sigma polynmial are simplified, the homomorphism polynomial can be identified for several new classes of graphs, and progress ...
Richard Alan Gillman
doaj +1 more source
ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS [PDF]
Journal of Algebraic Systems, 2015 Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set.
Saeid Alikhani, Sommayeh Jahari
doaj +1 more source
On graphs with the same restricted U -polynomial and the U -polynomial for rooted graphs [PDF]
Electronic Notes in Discrete Mathematics, 2018 In this abstract, we construct explicitly, for every k, pairs of non-isomorphic trees with the same restricted U-polynomial; by this we mean that the polynomials agree on terms with degree at most k. The construction is done purely in algebraic terms, after introducing and studying a generalization of the U-polynomial to rooted graphs.
Aliste Prieto, José +2 more
openaire +3 more sources
σ-polynomials and graph coloring
, 1978 A new class of graph polynomials is defined. Tight bounds on the coefficients of the polynomials are given, and the exact polynomials for several classes of graphs are derived.
Korfhage, Robert R
core +1 more source
Journal of Mathematics, 2021 Graph theory has provided a very useful tool, called topological index, which is a number from the graph M with the property that every graph N isomorphic to M value of a topological index must be same for both M and N.
Muhammad Irfan +4 more
doaj +1 more source
Discrete Mathematics, 2003 The chain polynomial of a graph was introduced in \textit{R. C. Read} and \textit{E. G. Whitehead jun.} [Discrete Math. 204, 337-356 (1999; Zbl 0960.05050)], where some basic properties of these polynomials were given as well. In the present paper further properties are investigated and the gained results are used to compute the chain polynomials of ...
openaire +2 more sources
, 2011 One of the most important and applied concepts in graph theory is to find the edge cover, vertex cover, and dominating sets with minimum cardinal also to find independence and matching sets with maximum cardinal and their polynomials.
Saeid Mohammadian, Mehdi Alaeiyan
core +1 more source
Counting Polynomials on Regular Iterative Structures [PDF]
Applied Medical Informatics, 2009 Subgraphs can results through application of criteria based on matrix which characterize the entire graph. The most important categories of criteria are the ones able to produce connected subgraphs (fragments). Theoretical frame on graph theory, a series
Lorentz JÄNTSCHI +2 more
doaj
Polynomials and graph homomorphisms
, 2022 We develop in the language of graph homomorphisms the connection between the Tutte polynomial and the state models of statistical physics. • The Tutte polynomial and homomorphism numbers. • Spin models and edge coloring models.
Regts, Guus +3 more
core