Exponential Independence Number of Some Graphs

DOI10.1142/S0129054118500260zbMath1441.05168OpenAlexW2900957800WikidataQ115523993 ScholiaQ115523993MaRDI QIDQ5384526

C. Çiftçi, Aysun Aytaç

Publication date: 24 June 2019

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

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

zbMATH Keywords

independencevulnerabilitydominationcomplex networksthorn graphexponential independence

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Exponential independence in subcubic graphs

Cites Work

• On the bondage number of middle graphs
• Domination alteration sets in graphs
• Domination with exponential decay
• Generalized Ramsey theory for graphs, X: Double stars
• The bondage number of a graph
• A survey of integrity
• Exponential independence
• Tough graphs and Hamiltonian circuits.
• Residual Closeness in Cycles and Related Networks
• On the average lower bondage number of a graph
• Binding Number and Wheel Related Graphs
• RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS
• Vulnerability Measures of Transformation Graph G^xy+
• COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS
• Network robustness and residual closeness
• Robustness of Regular Caterpillars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Exponential Independence Number of Some Graphs