Super-connected and hyper-connected jump graphs

Authors:
Baoyindureng Wu;Xiaoping Liu;Xiaofeng Guo
Affiliations:
School of Mathematics and System Sciences, Xinjiang University, Urumqi, Peoples' Republic of China;Xinjiang Polytechnical College, Urumqi, Peoples' Republic of China;Department of Mathematics, Xiamen University, Xiamen, Peoples' Republic of China
Venue:
International Journal of Computer Mathematics
Year:
2008

Citing 5
Cited 0

The superconnectivity of large digraphs and graphs

Proceedings of the first Malta conference on Graphs and combinatorics
Subgraph distances in graphs defined by edge transfers

Discrete Mathematics
Superconnectivity of bipartite digraphs and graphs

Discrete Mathematics
Connectivity of vertex and edge transitive graphs

Discrete Applied Mathematics
Graph Theory With Applications

Graph Theory With Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let G be a connected graph. The graph G is said to be super-connected if for every minimum vertex cut S of G, G-S has isolated vertices. Moreover, it is said to be hyper-connected if for every minimum vertex cut S, G-S has exactly two components, one of which is an isolated vertex. In this note, we give a necessary and sufficient condition for a graph G whose jump graph J(G) (the complement of line graph of G) is, respectively, super-connected and hyper-connected.