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

Reza Jafarpour-Golzari

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

Displaying similar documents to “Degree polynomial for vertices in a graph and its behavior under graph operations”

Mean value for the matching and dominating polynomial

Jorge Luis Arocha, Bernardo Llano (2000)

Discussiones Mathematicae Graph Theory

Similarity:

The mean value of the matching polynomial is computed in the family of all labeled graphs with n vertices. We introduce the dominating polynomial of a graph whose coefficients enumerate the dominating sets for a graph and study some properties of the polynomial. The mean value of this polynomial is determined in a certain special family of bipartite digraphs.

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...

Homomorphism and sigma polynomials.

Gillman, Richard Alan (1995)

International Journal of Mathematics and Mathematical Sciences

Similarity:

The matching polynomial of a distance-regular graph.

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

International Journal of Mathematics and Mathematical Sciences

Similarity:

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

Courcelle, Bruno (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A generalization of the dichromatic polynomial of a graph.

Farrell, E.J. (1981)

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:

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

Matchett, Philip (2004)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Degrees of Polynomial Solutions of a Class of Riccati - tipe Differential Equations*.

Mira Bhargava (1964)

Collectanea Mathematica

Similarity:

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:

Contribution to the problem of the spectra of compound graphs.

I. Gutman (1978)

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

Similarity:

A note on polynomials and $f$ -factors of graphs.

Shirazi, Hamed, Verstraëte, Jacques (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Existence of Polynomial Solutions of a Class of Riccati-Type Differential Equations.

H. Kaufman, Mira Bhargava (1965)

Collectanea Mathematica

Similarity:

The Acyclic Polynomial Of A Graph

Ivan Gutman (1977)

Publications de l'Institut Mathématique

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. ...