Homomorphism and sigma polynomials.

Gillman, Richard Alan

The search session has expired. Please query the service again.

Displaying similar documents to “Homomorphism and sigma polynomials.”

A multivariate interlace polynomial and its computation for graphs of bounded clique-width.

Courcelle, Bruno (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The matching polynomial of a distance-regular graph.

Beezer, Robert A., Farrell, E.J. (2000)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Degree polynomial for vertices in a graph and its behavior under graph operations

Reza Jafarpour-Golzari (2022)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We introduce a new concept namely the degree polynomial for the vertices of a simple graph. This notion leads to a concept, namely, the degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the degree polynomial sequence for some well-known graphs, we prove a theorem which gives a necessary condition for the realizability of a sequence of polynomials with positive integer coefficients. Also we calculate the degree polynomial for the vertices...

On a class of polynomials associated with the cliques in a graph and its applications.

Farrell, E.J. (1989)

International Journal of Mathematics and Mathematical Sciences

Similarity:

The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements.

Hagos, Elias M. (2000)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The $β$ -polynomials of complete graphs are real.

Li, Xueliang, Gutman, Ivan, Milovanović, V.Gradimir (2000)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

A generalization of the dichromatic polynomial of a graph.

Farrell, E.J. (1981)

International Journal of Mathematics and Mathematical Sciences

Similarity:

The higher-order matching polynomial of a graph.

Araujo, Oswaldo, Estrada, Mario, Morales, Daniel A., Rada, Juan (2005)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Contribution to the problem of the spectra of compound graphs.

I. Gutman (1978)

Publications de l'Institut Mathématique [Elektronische Ressource]

Similarity:

Independent vertex sets in some compound graphs.

Gutman, Ivan (1992)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

Inequalities between distance-based graph polynomials

I. Gutman, Olga Miljković, B. Zhou, M. Petrović (2006)

Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques

Similarity:

The Acyclic Polynomial Of A Graph

Ivan Gutman (1977)

Publications de l'Institut Mathématique

Similarity:

Bipartition Polynomials, the Ising Model, and Domination in Graphs

Markus Dod, Tomer Kotek, James Preen, Peter Tittmann (2015)

Discussiones Mathematicae Graph Theory

Similarity:

This paper introduces a trivariate graph polynomial that is a common generalization of the domination polynomial, the Ising polynomial, the matching polynomial, and the cut polynomial of a graph. This new graph polynomial, called the bipartition polynomial, permits a variety of interesting representations, for instance as a sum ranging over all spanning forests. As a consequence, the bipartition polynomial is a powerful tool for proving properties of other graph polynomials and graph...

Operations on well-covered graphs and the Roller-Coaster conjecture.

Matchett, Philip (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The Eccentric Connectivity Polynomial of some Graph Operations

Ashrafi, A., Ghorbani, M., Hossein-Zadeh, M. (2011)

Serdica Journal of Computing

Similarity:

The eccentric connectivity index of a graph G, ξ^C, was proposed by Sharma, Goswami and Madan. It is defined as ξ^C(G) = ∑ u ∈ V(G) degG(u)εG(u), where degG(u) denotes the degree of the vertex x in G and εG(u) = Max{d(u, x) | x ∈ V (G)}. The eccentric connectivity polynomial is a polynomial version of this topological index. In this paper, exact formulas for the eccentric connectivity polynomial of Cartesian product, symmetric difference, disjunction and join of graphs are presented. ...