𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the neighbour-integrity of sequential joined graphs

✍ Scribed by Dündar, Pinar; Ozan, Aysun

Book ID
118743816
Publisher
Taylor and Francis Group
Year
2000
Tongue
English
Weight
286 KB
Volume
74
Category
Article
ISSN
0020-7160

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On sequential labelings of graphs
On sequential labelings of graphs
✍ Thom Grace 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 276 KB

A valuation on a simple graph G IS an assignment of labels to the vertices of G which induces an assignment of labels to the edges of G. pvaluations, also called graceful labelings, and a-valuations, a subclass of graceful labelings, have an extensive literature; harmonious labelings have been intro

On the minimum rank of the join of graph
On the minimum rank of the join of graphs and decomposable graphs
✍ Francesco Barioli; Shaun Fallat 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 184 KB

For a given undirected graph G, the minimum rank of G is defined to be the smallest possible rank over all real symmetric matrices A whose (i, j )th entry is nonzero whenever i / = j and {i, j } is an edge in G. In this work we consider joins and unions of graphs, and characterize the minimum rank o

On the join of graphs and chromatic uniq
On the join of graphs and chromatic uniqueness
✍ G. L. Chia 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 519 KB

## Abstract A graph is chromatically unique if it is uniquely determined by its chromatic polynomial. Let __G__ be a chromatically unique graph and let __K__~__m__~ denote the complete graph on __m__ vertices. This paper is mainly concerned with the chromaticity of __K__~__m__~ + __G__ where + deno