𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the skewness of the join of graphs

✍ Scribed by Chia, Gek L.; Sim, Kai An

Book ID
122001159
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
374 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

On the sphericity for the join of many g
On the sphericity for the join of many graphs
✍ Hiroshi Maehara πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 110 KB

It is proved that given any number of graphs of order at most n, the sphericity of their join does not exceed 2(n-1). We introduce an adjacency relation into Euclidean n-space E" so that it may be regarded as an infinite graph: Two points x and y of E" are defined to be adjacent if and only if 0<[x