AKCE International Journal of Graphs and Combinatorics (Dec 2019)
On 3-total edge product cordial labeling of a carbon nanotube network
Abstract
For a simple graph with the vertex set and the edge set and for an integer , , an edge labeling induces a vertex labeling defined by , where are the edges incident to the vertex . The function is called a -total edge product cordial labeling of if for every , , where and are the number of edges and vertices with and , respectively. In this paper, we investigate the 3-total edge product cordial labeling of a carbon nanotube network.
Keywords