Inspired by the definition of integrity and the alternative formulations for integrity, we investigate the D−Integrity and E−Integrity numbers of a graph in the present study. The D-Integrity number of a graph G is denoted by DIk(G) defined as: DIk(G) = ∑ p Dk (G), and the E -Integrity number of a graph G, is denoted by E Il (G) defined as: E Il (G) = ∑ p El (G). In this paper, we establish k=1 l=0 the general formulas for the D−Integrity and E−Integrity numbers of some classes of graphs. Also, some properties of D−Integrity and E−Integrity numbers are established.
Digital Object Identifier (DOI)
Senan Mahde, Sultan; M. Sibih, Alanod; and Mathad, Veena
"D-Integrity and E-Integrity Numbers in Graphs,"
Applied Mathematics & Information Sciences: Vol. 14:
3, Article 12.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol14/iss3/12