𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Total edge irregularity strength of complete graphs and complete bipartite graphs

✍ Scribed by Stanislav Jendrol’; Jozef Miškuf; Roman Soták

Book ID
118435544
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
475 KB
Volume
310
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bipartite Graphs Whose Edge Algebras Are
Bipartite Graphs Whose Edge Algebras Are Complete Intersections
✍ Mordechai Katzman 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 115 KB

Let R be a monomial subalgebra of k x 1 x N generated by square free monomials of degree two. This paper addresses the following question: when is R a complete intersection? For such a k-algebra we can associate a graph G whose vertices are x 1 x N and whose edges are x i x j x i x j ∈ R . Convers

Pagenumber of complete bipartite graphs
Pagenumber of complete bipartite graphs
✍ Douglas J. Muder; Margaret Lefevre Weaver; Douglas B. West 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 929 KB
Hall parameters of complete and complete
Hall parameters of complete and complete bipartite graphs
✍ M. M. Cropper; A. J. W. Hilton 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 287 KB

## Abstract Given a graph __G__, for each υ ∈__V__(__G__) let __L__(υ) be a list assignment to __G__. The well‐known choice number __c__(__G__) is the least integer __j__ such that if |__L__(υ)| ≥__j__ for all υ ∈__V__(__G__), then __G__ has a proper vertex colouring ϕ with ϕ(υ) ∈ __L__ (υ) (∀υ ∈__