Exponential independence number of some graphs

DOI10.1142/S0129054118500260MaRDI QIDQ5384526zbMATH OpenOpenAlexWikidataFDO

Authors 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

complex networksdominationexponential independenceindependencethorn graphvulnerability

Mathematics Subject Classification ID

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

Recommendations

• Exponential independence
• Exponential independence in subcubic graphs
• On exponential domination of some graphs
• On exponential trees
• Domination with exponential decay

Cites work

• A survey of integrity
• Average lower domination number of graphs
• Binding number and wheel related graphs
• COMPUTING THE RUPTURE DEGREE IN COMPOSITE GRAPHS
• Computing the tenacity of some graphs
• Domination alteration sets in graphs
• Domination with exponential decay
• Exponential independence
• Generalized Ramsey theory for graphs, X: Double stars
• Graph theory with applications
• scientific article; zbMATH DE number 6836971 (Why is no real title available?)
• scientific article; zbMATH DE number 4053662 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1484052 (Why is no real title available?)
• scientific article; zbMATH DE number 6761041 (Why is no real title available?)
• Network robustness and residual closeness
• On computing the vulnerability of some graphs as average
• On exponential domination of some graphs
• On the average lower bondage number of a graph
• On the bondage number of middle graphs
• Relation between Randić index and average distance of trees
• Residual closeness in cycles and related networks
• Residual closeness of wheels and related networks
• Robustness of regular caterpillars
• Rupture degree and middle graphs
• The bondage number of a graph
• The bondage number of some graphs
• Tough graphs and Hamiltonian circuits.
• Vulnerability Measures of Transformation Graph G^xy+

Cited in

(3)

• On exponential trees
• Exponential independence in subcubic graphs
• Exponential independence

This page was built for publication: Exponential independence number of some graphs

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