Fault Tolerance and 2-Domination in Certain Interconnection Networks
- Lian Chen
- Xiujun Zhang
Abstract
A graph could be understood as a sensor network, in which the vertices represent the sensors and two vertices are adjacent if and only if the corresponding devices can communicate with each other. For a network G, a 2-dominating function on G is a function f : V(G) → [0, 1] such that each vertex assigned with 0 has at least two neighbors assigned with 1. The weight of f is Σ_u∈V(G) f (u), and the minimum weight over all 2-dominating functions is the 2-domination number of G. The 2-dominating set problem consists of finding the 2-domination number of a graph and it was proposed to model the fault tolerance of a sensor network. In this paper, we determined substantial 2-domination numbers of 2-dimensional meshes, cylinders, tori and hypercubes.
- Full Text:
PDF
- DOI:10.5539/jmr.v11n2p181
Journal Metrics
- h-index (December 2021): 22
- i10-index (December 2021): 78
- h5-index (December 2021): N/A
- h5-median (December 2021): N/A
( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )
Index
- Academic Journals Database
- ACNP
- Aerospace Database
- BASE (Bielefeld Academic Search Engine)
- Civil Engineering Abstracts
- CNKI Scholar
- COPAC
- DTU Library
- EconPapers
- Elektronische Zeitschriftenbibliothek (EZB)
- EuroPub Database
- Google Scholar
- Harvard Library
- IDEAS
- Infotrieve
- JournalTOCs
- LOCKSS
- MathGuide
- MathSciNet
- MIAR
- PKP Open Archives Harvester
- Publons
- RePEc
- ResearchGate
- Scilit
- SHERPA/RoMEO
- SocioRePEc
- Standard Periodical Directory
- Technische Informationsbibliothek (TIB)
- The Keepers Registry
- UCR Library
- Universe Digital Library
- WorldCat
Contact
- Sophia WangEditorial Assistant
- jmr@ccsenet.org