Abstract
A total edge irregular k -labelling ν of a graph G is a labelling of the vertices and edges of G with labels from the set { 1 , … , k } in such a way that for any two different edges e and f their weights φ ( f ) and φ ( e ) are distinct. Here, the weight of an edge g = u v is φ ( g ) = ν ( g ) + ν ( u ) + ν ( v ) , i. e. the sum of the label of g and the labels of vertices u and v . The minimum k for which the graph G has an edge irregular total k -labelling is called the total edge irregularity strength of G . We have determined the exact value of the total edge irregularity strength of complete graphs and complete bipartite graphs.
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.
