Slavery accessibility integrity number of graphs
1
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
The slavery accessibility integrity number of G is the minimum car- dinality of a set E1(G) of edges whose removal from E(G) results a graph with accessibility integrity greater than accessibility integrity of G, and denoted by SAI(G). SAI(G) = 0 for some graphs, but SAI(G) 6= q for any (p; q) graph. First we discuss various properties of slavery accessibility integrity number of graphs. We calculate the slavery accessibility integrity number for several classes of graphs. Next we prove that for every tree T , SAI(T) 2, and we characterize all trees with p 10, that are AI- stellar and SAI(T) = 2. Finally, we discuss accessibility integrity of some graphs.
Abstract
The slavery accessibility integrity number of G is the minimum car- dinality of a set E1(G) of edges whose removal from E(G) results a graph with accessibility integrity greater than accessibility integrity of G, and denoted by SAI(G). SAI(G) = 0 for some graphs, but SAI(G) 6= q for any (p; q) graph. First we discuss various properties of slavery accessibility integrity number of graphs. We calculate the slavery accessibility integrity number for several classes of graphs. Next we prove that for every tree T , SAI(T) 2, and we characterize all trees with p 10, that are AI- stellar and SAI(T) = 2. Finally, we discuss accessibility integrity of some graphs.
참고문헌 (15)
- C. A. Barefoot, "Vulnerability in graphs - A comparative survey", J. Combin. Math. Combin. Comput, 1, pp.12~22 (1987)
- L. H. Clark, "Computational complexity of integrity", J. Combin. Math. Combin. Comput, 2, pp.179~191 (1987)
- M. Cozzens, "The tenacity of a graph", Proc. Seventh International Conference on the Theory and Applications of Graphs, pp.1111~1122 (1995)
- P. Dundar, "Accessibility number and the neighbor-integrity of generalised petersen graphs", Neural network world, 2, pp.167~174 (2001)
- R. Frucht, "On the corona of two graphs", Aequat. Math, 4, pp.322~325 (1970)
- W. Goddard, "Integrity in graphs: bounds and basics", J. Combin. Math. Combin. Comput, 7, pp.139~151 (1990)
- I. Gutman, "Graph theory and molecular orbitals, Total - electron energy of alternant hydrocarbons", Chem. Phys. Lett, 17, pp.535~538 (1972)
- F. Harary, "Graph Theory" (1969), Addison Wesley
- B. L. Hartnell, "A bound on size of a graph with given order and bondage number", Discrete Math, 197-198, pp.409~413 (1999)
- M. A. Seoud, "Harmonious labellings of helms and related graphs", ~
- Sultan Senan Mahde, "Hub-integrity of graphs", Bull. Int. Math. Virtual Inst, 5, pp.57~64 (2015)
- SULTAN SENAN MAHDE, "Distance majorization integrity of graphs", Proceedings of the Jangjeon Mathematical Society(장전수학회 논문집), 20(3), pp.353~364 (2017), 장전수학회[DOI]
- Sultan Senan Mahde, "Global domination integrity of graphs", Math. Sci. Let, 6, pp.263~269 (2017)
- Sultan Senan Mahde, "Veena Mathad and Ismail Naci Cangul", Accessibility integrity of graphs, ~
- Veena Mathad, "Vulnerability: vertex neighbor integrity of middle graphs", J. Comp. Math. Sci, 6, pp.43~48 (2015)