Research on the Domination-Stability of Network G2

Jian Xiang Cao; Zheng Tao Jiang; Feng Xin

doi:10.4028/www.scientific.net/AMM.513-517.566

Paper Titles

The Design of Public Key Cryptography for Key Exchange Base on Multivariate Equations
p.552

Iris Feature Extraction Algorithm Valuation Based on the Fuzzy Clustering Evaluation Model
p.555

A Two-Step Iris Recognition Algorithm
p.559

The Application Research of Cloud Computing in the Library
p.563

Research on the Domination-Stability of Network G²
p.566

Fusion Algorithm of Infrared and TV Image Based on Image Quality Evaluation Method
p.570

Research on Multi-Attribute Sequence Query Processing Techniques over Data Streams
p.575

A DDoS Detection Approach Based on CNN in Cloud Computing
p.579

Initial Alignment Algorithm Study Based on Rotating Modulation and Kalman Filtering
p.585

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 513-517Research on the Domination-Stability of Network G2

Research on the Domination-Stability of Network G²

Abstract:

It has been known that an interconnection network can be modeled by a connected graph whose vertices represent sites of the network and whose edges represent physical communication links. Being the underlying theory of network, graph theory can be used to investigate network issues. In this paper we consider two parameters of graph: the domination number and bondage number b (G). These parameters measure to some extent the robustness of an interconnection network with respect to link failures. By constructing a family of minimum dominating sets we calculate the domination number and bondage number of graph G².

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 513-517)

Pages:

566-569

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.513-517.566

Citation:

Cite this paper

Online since:

February 2014

Authors:

Jian Xiang Cao*, Zheng Tao Jiang, Feng Xin

Keywords:

Bondage Number, Domination Number, G², Graph

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Domination in Graphs: Advanced Topics, Marcel Dekker, New York, (1998).

Google Scholar

[2] T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, (1998).

Google Scholar

[3] J. F. Fink, M. S. Jacobson, L. F. Kinch, J. Roberts, "The bondage number of a graph. Discrete Mathematics, 86(1990) 47-57.

DOI: 10.1016/0012-365x(90)90348-l

Google Scholar

[4] Carlson, K., Develin, M.: On the bondage number of planar and directed graphs. Discrete Math. 306(8–9), 820–826 (2006).

DOI: 10.1016/j.disc.2006.02.008

Google Scholar

[5] Dunbar J.E., Haynes T.W., Teschner. U., Volkmann. L.: Bondage, insensitivity, and reinforcement. Domination in Graphs: Advanced Topics (Haynes, T.W., Hedetniemi, S.T., Slater, P.J. eds. ), 471–489.

Google Scholar

[6] J.A. Bondy and U.S.R. Murty, Graph Theory with Application, North-Hokkand, New York, (1976).

Google Scholar

[7] B.L. Hartnell and D.F. Rall, Bounds on the bondage number of a graph. Discrete Math. 128 (1994) 173-177.

DOI: 10.1016/0012-365x(94)90111-2

Google Scholar