Abstract
The (2,1)-total labeling number of a graph is the width of the smallest range of integers that suffices to label the vertices and the edges of such that no two adjacent vertices have the same label, no two adjacent edges have the same label and the difference between the labels of a vertex and its incident edges is at least 2. In this paper, we studied the upper bound of of Sn+1∨Pm and Sn+1×Pm
Highlights
Our terminology and notation will be standard
We studied the upper bound of 2T (G) of Sn 1 Pm and Sn 1 Pm
(v) the be the dedistance of vertices x, y of G, x is the smallest integer greater than x
Summary
Our terminology and notation will be standard. The reader is referred to [1] for the undefined terms. For a graph G , let V (G) , E(G) , Δ(G) and δ(G) denote, respectively, its vertex set, edge set, maximum degree and minimum degree.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
