DocumentCode :
2166400
Title :
The Geodetic Number of Cm × Cn
Author :
Cao, Jianxiang ; Wu, Bin ; Shi, Minyong
Author_Institution :
Sch. of Comput. Sci., Comunication Univ. of China, Beijing, China
fYear :
2009
fDate :
20-22 Sept. 2009
Firstpage :
1
Lastpage :
3
Abstract :
Graph theory is the theoretical fundamental of network technologies. This paper reports an investigation of stability issues of the network technologies based on the graph theory. It also presents solutions of the geodetic number of graph Cm times Cn. There are many parameters which can measure to some extent the robustness of an interconnection network with respect to link failures, such as domination number and bondage number. Another parameter, the geodetic number, has been studied widely in the recent literature. Determining the geodetic number of an arbitrary graph however can be proved to be NP-hard. Therefore it is natural to investigate some specific cases for the geodetic number of special graphs. The solving process of one of such cases is presented.
Keywords :
computational complexity; graph theory; number theory; optimisation; NP-hard problems; geodetic number; graph Cm times Cn; graph theory; network technologies; Animation; Bonding; Computer crime; Computer science; Graph theory; Multiprocessor interconnection networks; Robustness; Software libraries; Stability; Transmitters;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Management and Service Science, 2009. MASS '09. International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-4638-4
Electronic_ISBN :
978-1-4244-4639-1
Type :
conf
DOI :
10.1109/ICMSS.2009.5304507
Filename :
5304507
Link To Document :
بازگشت