The binding number of a graph and its circuits

DOI10.1007/BF01539486MaRDI QIDQ1097285zbMATH OpenFDO

Authors Ronghua Shi

Publication date 1985

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01539486

zbMATH Keywords

binding numberHamiltonian circuitmaximum degreepancyclic

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99)

Recommendations

• The binding number of a graph and its pancyclism
• Binding number, cycles, and cliques
• The binding number of a graph and its triangle
• scientific article; zbMATH DE number 4085712
• An optimal binding number condition for bipancyclism

Cites work

• A lower bound for communication on the crossbar
• Graph theory with applications
• scientific article; zbMATH DE number 3637904 (Why is no real title available?)
• The binding number of a graph and its Anderson number
• The binding number of a graph and its triangle

Cited in

(10)

• The binding number of a graph and its triangle
• Computing the binding number of a graph
• Bounding the number of circuits of a graph
• scientific article; zbMATH DE number 4035879 (Why is no real title available?)
• scientific article; zbMATH DE number 4085712 (Why is no real title available?)
• scientific article; zbMATH DE number 165528 (Why is no real title available?)
• scientific article; zbMATH DE number 3999971 (Why is no real title available?)
• Binding number, cycles, and cliques
• The binding number of a zero divisor graph
• The binding number of a graph and its pancyclism

This page was built for publication: The binding number of a graph and its circuits

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