𝔖 Bobbio Scriptorium
✦   LIBER   ✦

When is NEPS of graphs connected?

✍ Scribed by Dragan Stevanović

Book ID
104156756
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
77 KB
Volume
301
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

We give the sufficient and necessary condition for the connectedness of non-complete extended p-sum (NEPS) of connected graphs, and we find the number of components of NEPS when it is disconnected. We show that the components of NEPS are mutually isomorphic and isomorphic to NEPS of the same non-bipartite factors and several copies of K 2 in the case that K 2 is the only bipartite factor of NEPS.

📜 SIMILAR VOLUMES

When are random graphs connected
When are random graphs connected
✍ S. Kalikow; B. Weiss 📂 Article 📅 1988 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 432 KB
Every connected graph is a query graph
Every connected graph is a query graph
✍ Peter M. Winkler 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB

Let Vbe a set of bit strings of length k, i.e., V C {0, l}'. The query graph Q ( V ) is defined as follows: the vertices of Q(V) are the elements of V, and {O,V} is an edge of Q ( V ) if and only if no other W E Vagrees with U in all the positions in which V does. If Vrepresents the set of keys for

Every connected, locally connected graph
Every connected, locally connected graph is upper embeddable
✍ Ladislav Nebeský 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

## Abstract In this Note it is proved that every connected, locally connected graph is upper embeddable. Moreover, a lower bound for the maximum genus of the square of a connected graph is given.

When is the Comaximal Graph Split?
When is the Comaximal Graph Split?
✍ Jinnah, M. I.; Mathew, Shine C. 📂 Article 📅 2012 🏛 Taylor and Francis Group 🌐 English ⚖ 120 KB