|
|
 |
| |
|
|
|
D-Integrity and E-Integrity Numbers in Graphs |
|
|
|
PP: 453-458 |
|
|
|
doi:10.18576/amis/140312
|
|
|
|
Author(s) |
|
|
|
Sultan Senan Mahde,
Alanod M. Sibih,
Veena Mathad,
|
|
|
|
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.
|
|
|
|
|
|
|
|
