Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering
Hamad, Asma
Unknown Affiliation
Computer Science & IT Electrical & Electronics Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
4-total edge product cordial for some star related graphs Azaizeh, Almothana; Hasni, Roslan; Haddad, Firas; Alsmadi, Mutasem; Alkhasawneh, Raed; Hamad, Asma
International Journal of Electrical and Computer Engineering (IJECE) Vol 12, No 4: August 2022
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijece.v12i4.pp4007-4020

Abstract

Let G = (V (G), E(G)) be a graph, define an edge labeling function ψ from E(G) to {0, 1, . . . , k − 1} where k is an integer, 2 ≤ k ≤ |E(G)|, induces a vertex labeling function ψ∗ from V (G) to {0, 1, . . . , k − 1} such that ψ∗(v) = ψ(e1) × ψ(e2) × . . . × ψ(en) mod k where e1, e2, . . . , en are all edge incident to v. This function ψ is called a k-total edge product cordial (or simply k-TEPC) labeling of G if the absolute difference between number of vertices and edges labeling with i and number of vertices and edges labeling with j no more than 1 for all i, j ∈ {0, 1, . . . , k − 1}. In this paper, 4-total edge product cordial labeling for some star related graphs are determined.
Co-Authors Alkhasawneh, Raed Alsmadi, Mutasem Azaizeh, Almothana Haddad, Firas Roslan Hasni, Roslan