✦ LIBER ✦

On graph invariants satisfying the deletion-contraction formula

✍ Scribed by Dohmen, Klaus

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 294 KB
Volume: 21
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199603)21:3<311::aid-jgt5>3.0.co;2-t

No coin nor oath required. For personal study only.

✦ Synopsis

As a generalization of chromatic polynomials, this paper deals with real-valued mappings + on the class of graphs satisfying +(GI) = +(Gz) for all pairs GI, GZ of isomorphic graphs and +(G) = +(Ge) -rC/(G/e) for all graphs G and all edges e of G, where the definition of G/e is nonstandard. In particular, new inequalities for chromatic polynomials are presented.

📜 SIMILAR VOLUMES

Contraction–Deletion Invariants for Grap

Contraction–Deletion Invariants for Graphs

✍ Béla Bollobás; Luke Pebody; Oliver Riordan 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 192 KB

We consider generalizations of the Tutte polynomial on multigraphs obtained by keeping the main recurrence relation T(G)=T(GÂe)+T(G&e) for e # E(G) neither a bridge nor a loop and dropping the relations for bridges and loops. Our first aim is to find the universal invariant satisfying these conditio

On some bandwidth restricted versions of

On some bandwidth restricted versions of the satisfiability problem of propositional CNF formulas

✍ V. Arvind; S. Biswas 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 797 KB

The max-cut problem on graphs not contra

The max-cut problem on graphs not contractible to K5

✍ Francisco Barahona 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 454 KB

Another aspect of graph invariants depen

Another aspect of graph invariants depending on the path metric and an application in nanoscience

✍ M.H. Khalifeh; H. Yousefi-Azari; A.R. Ashrafi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 471 KB

The contraction principle for set valued

The contraction principle for set valued mappings on a metric space with a graph

✍ Ismat Beg; Asma Rashid Butt; S. Radojević 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 305 KB

Let (X, d) be a metric space and F : X ; X be a set valued mapping. We obtain sufficient conditions for the existence of a fixed point of the mapping F in the metric space X endowed with a graph G such that the set V (G) of vertices of G coincides with X and the set of edges of G is E(G) = {(x, y) :

The chromaticity of complete bipartite g

The chromaticity of complete bipartite graphs with at most one edge deleted

✍ C. P. Teo; K. M. Koh 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 364 KB 👁 1 views

## Abstract Let __K(p, q), p ≤ q__, denote the complete bipartite graph in which the two partite sets consist of __p__ and __q__ vertices, respectively. In this paper, we prove that (1) the graph __K(p, q)__ is chromatically unique if __p__ ≥ 2; and (2) the graph __K(p, q)__ ‐ __e__ obtained by del