Binding number and wheel related graphs

DOI10.1142/S0129054117500034zbMATH Open1360.05086OpenAlexW2600239574MaRDI QIDQ2979673FDOQ2979673

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

Recommendations

• scientific article
• scientific article
• The binding number of line graphs and total graphs
• scientific article
• scientific article; zbMATH DE number 431470

zbMATH Keywords

vulnerabilityfriendship graphnetwork design and communicationbinding numbersunflowergear graphhelm

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Exponential Domination Critical and Stability in Some Graphs
• Title not available (Why is that?)
• Exponential Independence Number of Some Graphs
• Global distribution center number of some graphs and an algorithm
• Binding number for coprime graph of groups
• Irregular colorings of friendship graph families
• On the average lower bondage number of graphs under join and corona operations

This page was built for publication: Binding number and wheel related graphs

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