𝔖 Bobbio Scriptorium
✦   LIBER   ✦

N2-locally disconnected graphs

✍ Scribed by Zdenĕk Ryjác̆ek

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
269 KB
Volume
121
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

The edge-induced subgraph on the set of all edges of a graph G that are adjacent to a given vertex x is called the neighbourhood of the second type of x in G and is denoted by N2(x, G) (an edge yz is said to be adjacent to x if y # x fz and y or z is adjacent to x). A graph G is NJocally disconnected if Nz(x, G) is disconnected for every vertex x of G. The main aim of the present paper is to find the maximum size of an N,-locally disconnected graph of a given order.

📜 SIMILAR VOLUMES

Hamiltonian N2-locally connected claw-fr
Hamiltonian N2-locally connected claw-free graphs
✍ Hong-Jian Lai; Yehong Shao; Mingquan Zhan 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 63 KB 👁 1 views

A graph G is N 2 -locally connected if for every vertex v in G, the edges not incident with v but having at least one end adjacent to v in G induce a connected graph. In 1990, Ryja ´c ˇek conjectured that every 3-connected N 2 -locally connected claw-free graph is Hamiltonian. This conjecture is pro

Hamiltonian circuits in N2-locally conne
Hamiltonian circuits in N2-locally connected K1,3-free graphs
✍ ZdeněK Ryjáček 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 407 KB 👁 1 views

## Abstract There are many results concerned with the hamiltonicity of __K__~1,3~‐free graphs. In the paper we show that one of the sufficient conditions for the __K__~1,3~‐free graph to be Hamiltonian can be improved using the concept of second‐type vertex neighborhood. The paper is concluded with

Disconnected graphs with magic labelings
Disconnected graphs with magic labelings
✍ R.H. Jeurissen 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 729 KB

We characterise edges in mixed graphs that get a iabel 0 for every labeling with a constant index (index 0, respectively). We use this to investigate the magicity of disconnected mixed graphs with magic components. For the undirected case a necessary and sufficient condition is derived. We consider

On locally k-critically n-connected grap
On locally k-critically n-connected graphs
✍ Jianji Su 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 479 KB

Su, J., On locally k-critically n-connected graphs, Discrete Mathematics 120 (1993) 183-190. Let 0 # W'g V(G). The graph G is called a W-locally k-critically n-connected graph or simply a W-locally (n, k)-graph, if for all V'G W with 1 V'I 6 k and each fragment F of G we have that K(G-V')=n-1 V' and

Locally Pancyclic Graphs
Locally Pancyclic Graphs
✍ Ladislav Stacho 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 215 KB

We prove the following theorem. Let G be a graph of order n and let W V(G). If |W | 3 and d G (x)+d G ( y) n for every pair of non-adjacent vertices x, y # W, then either G contains cycles C 3 ,