Binding Number and Wheel Related Graphs

DOI10.1142/S0129054117500034zbMath1360.05086OpenAlexW2600239574MaRDI QIDQ2979673

Vecdi Aytac, Zeynep Nihan Odabaş Berberler

Publication date: 26 April 2017

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

Full work available at URL: https://doi.org/10.1142/s0129054117500034

zbMATH Keywords

vulnerabilitysunflowerfriendship graphnetwork design and communicationbinding numbergear graphhelm

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

Irregular colorings of friendship graph families ⋮ On the average lower bondage number of graphs under join and corona operations ⋮ Binding number for coprime graph of groups ⋮ Exponential Independence Number of Some Graphs ⋮ Exponential Domination Critical and Stability in Some Graphs ⋮ Global distribution center number of some graphs and an algorithm

Cites Work

• The binding number of a graph and its cliques
• On a class of posets and the corresponding comparability graphs
• Computing the binding number of a graph
• Tough graphs and Hamiltonian circuits.
• Relationships between rupture degree and other parameters
• Rupture degree of graphs
• The binding number of a graph and its Anderson number

This page was built for publication: Binding Number and Wheel Related Graphs