Sufficient conditions for graphs to be spanning connected

DOI10.1016/J.AMC.2020.125198MaRDI QIDQ2177900zbMATH OpenOpenAlexFDO

Authors Eminjan Sabir, Jixiang Meng

Publication date 7 May 2020

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2020.125198

zbMATH Keywords

degree sequenceHamiltonicityspanning connectivityspanning laceabilitystructure fault tolerance

Mathematics Subject Classification ID

Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40)

Recommendations

• On spanning connected graphs
• Generalizations of the classics to spanning connectedness
• New sufficient conditions on Hamiltonicity of graphs
• On the spanning connectivity of graphs
• scientific article; zbMATH DE number 1246415

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• A group-theoretic model for symmetric interconnection networks
• A method in graph theory
• An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs
• Biclosure and bistability in a balanced bipartite graph
• Graph theory
• Hamilton connected graphs
• Note on Hamilton Circuits
• On Hamilton's ideals
• On maximal paths and circuits of graphs
• On spanning connected graphs
• On the spanning connectivity of the generalized Petersen graphs \(P(n, 3)\)
• On the spanning connectivity of tournaments
• Some Theorems on Abstract Graphs
• Super spanning connectivity on WK-recursive networks
• The spanning laceability on the faulty bipartite hypercube-like networks
• Variations on the Hamiltonian Theme

Cited in

(3)

• Generalizations of the classics to spanning connectedness
• On spanning connected graphs
• Degree sequence conditions for a graph to be disjoint path coverable

This page was built for publication: Sufficient conditions for graphs to be spanning connected

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