The binding number of a graph and its circuits

DOI10.1007/BF01539486zbMATH Open0635.05042MaRDI QIDQ1097285FDOQ1097285

Authors: Ronghua Shi 

Publication date: 1985

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

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

zbMATH Keywords

maximum degreepancyclicbinding numberHamiltonian circuit

Mathematics Subject Classification ID

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

Cites Work

• Graph theory with applications
• Title not available (Why is that?)
• The binding number of a graph and its Anderson number
• The binding number of a graph and its triangle
• A lower bound for communication on the crossbar

Cited In (10)

• Computing the binding number of a graph
• The binding number of a zero divisor graph
• Binding number, cycles, and cliques
• The binding number of a graph and its triangle
• Title not available (Why is that?)
• Title not available (Why is that?)
• The binding number of a graph and its pancyclism
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounding the number of circuits of a graph

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)