VERTEX VULNERABILITY PARAMETER OF GEAR GRAPHS

DOI10.1142/S0129054111008635zbMath1226.68070OpenAlexW2059273818MaRDI QIDQ3173943

Tufan Turaci, Aysun Aytaç

Publication date: 10 October 2011

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

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

zbMATH Keywords

connectivitynetwork design and communicationgear graphaverage lower independence number

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Related Items (10)

The vulnerability of some networks including cycles via domination parameters ⋮ On agglomeration-based rupture degree in networks and a heuristic algorithm ⋮ On the average lower bondage number of graphs under join and corona operations ⋮ The average lower reinforcement number of a graph ⋮ On the average lower bondage number of a graph ⋮ Agglomeration-Based Node Importance Analysis in Wheel-Type Networks ⋮ A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs ⋮ Distance and eccentricity based polynomials and indices of m−level Wheel graph ⋮ Laplacian and signless Laplacian spectra and energies of multi-step wheels ⋮ Efficient Identification of Node Importance Based on Agglomeration in Cycle-Related Networks

Cites Work

• Unnamed Item
• On average lower independence and domination numbers in graphs
• An upper bound for the independent domination number
• Independent domination in regular graphs
• Tough graphs and Hamiltonian circuits.
• Graph Classes: A Survey

This page was built for publication: VERTEX VULNERABILITY PARAMETER OF GEAR GRAPHS