Super-connected and hyper-connected jump graphs

DOI10.1080/00207160701600069zbMATH Open1151.05033OpenAlexW2019658487MaRDI QIDQ3545667FDOQ3545667

Authors: Baoyindureng Wu, Xiaofeng Guo, Xiaoping Liu 

Publication date: 11 December 2008

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160701600069

Recommendations

• Super-connected edge transitive graphs
• The super-connectivity of Johnson graphs
• Super-connected but not super edge-connected graphs
• Superconnected and hyperconnected small degree transitive graphs
• On super i‐connected graphs
• Superconnectivity of bipartite digraphs and graphs
• Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs
• The superconnectivity of large digraphs and graphs
• Super connectivity of line graphs and digraphs
• Superconnected circulant digraphs

zbMATH Keywords

line graphcomplementconnectivityjump graph

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• The superconnectivity of large digraphs and graphs
• Connectivity of vertex and edge transitive graphs
• Graph theory with applications
• Synthesis of reliable networks - a survey
• Superconnectivity of bipartite digraphs and graphs
• On unreliability polynomials and graph connectivity in reliable network synthesis
• Subgraph distances in graphs defined by edge transfers
• Hamiltonian jump graphs

Cited In (4)

• Title not available (Why is that?)
• Sufficient conditions for graphs to be super connected
• Super-connected but not super edge-connected graphs
• Domination number and feedback vertex number of complements of line graphs

This page was built for publication: Super-connected and hyper-connected jump graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545667)