D-Integrity and E-Integrity Numbers in Graphs

Authors

Sultan Senan Mahde, Department of Mathematics, Faculty of Education and Science, Al-Baydha University, Al-Baydha, YemenFollow
Alanod M. Sibih, Department of Mathematics, Jamoum University College, Umm Al-Qura University, Saudi ArabiaFollow
Veena Mathad, Department of Studies in Mathematics, University of Mysore, Manasagangotri, Mysuru, IndiaFollow

Author Country (or Countries)

Yemen

Abstract

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)

http://dx.doi.org/10.18576/amis/140312

Recommended Citation

Senan Mahde, Sultan; M. Sibih, Alanod; and Mathad, Veena (2020) "D-Integrity and E-Integrity Numbers in Graphs," Applied Mathematics & Information Sciences: Vol. 14: Iss. 3, Article 12.
DOI: http://dx.doi.org/10.18576/amis/140312
Available at: https://digitalcommons.aaru.edu.jo/amis/vol14/iss3/12