Toughness and binding number bounds of star-like and path factor

DOI10.1051/RO/2023057zbMATH Open1521.05188OpenAlexW4366140955MaRDI QIDQ6050584

Author name not available (Why is that?), Xingchao Deng

Publication date: 19 September 2023

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2023057

zbMATH Keywords

pathcomplete graphstarbinding numberfractional factorisolated toughness numbertoughness number

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Paths and cycles (05C38) Connectivity (05C40) Density (toughness, etc.) (05C42)

Recommendations

• Title not available (Why is that?) 👍 👎
• Bondage number of strong product of two paths 👍 👎
• Toughness, binding number and restricted matching extension in a graph 👍 👎
• The bondage number of the strong product of a complete graph with a path and a special starlike tree 👍 👎
• Stars and bonds in crossing-critical graphs 👍 👎
• Binding Number, Toughness and General Matching Extendability in Graphs 👍 👎
• Isolated toughness and path-factor uniform graphs 👍 👎
• Stars and Bonds in Crossing-Critical Graphs 👍 👎
• TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS 👍 👎
• Tight concentration of star saturation number in random graphs 👍 👎

This page was built for publication: Toughness and binding number bounds of star-like and path factor

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