THE FORGOTTEN INDEX OF CERTAIN EDGE-GLUING GRAPHS
The forgotten index is defined as ( ) ∑ ( )( ) . Where ( ) is a degree of vertex . In this paper, we study certain known graphs such as cycle, complete, wheel, and web graphs, then computed the forgotten index of their edge-gluing graphs
Saved in:
Main Authors: | Ahmed M. Salih, Nabeel E. Arif |
---|---|
Format: | Article |
Language: | English |
Published: |
Tikrit University
2023-01-01
|
Series: | Tikrit Journal of Pure Science |
Subjects: | |
Online Access: | https://tjpsj.org/index.php/tjps/article/view/818 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Solving Edges Deletion Problem of Complete Graphs
by: Anwar N. Jasim, et al.
Published: (2024-12-01) -
Dividing Graceful Labeling of Certain Tree Graphs
by: Abdullah Zahraa O, et al.
Published: (2020-08-01) -
ON A CLASS OF EDGE-TRANSITIVE DISTANCE-REGULAR ANTIPODAL COVERS OF COMPLETE GRAPHS
by: Ludmila Yu. Tsiovkina
Published: (2021-12-01) -
SECURE VERTEX-EDGE DOMINATION IN HYPERCUBE AND GRID GRAPHS: APPLICATIONS OF CYBERSECURITY IN BANKING FOR SECURE TRANSACTIONS
by: C. Ruby Sharmila, et al.
Published: (2025-06-01) -
NP-completeness and One Polynomial Subclass of the Two-Step Graph Colouring Problem
by: Natalya Sergeevna Medvedeva, et al.
Published: (2019-09-01)