2018
DOI: 10.1155/2018/9250424
|View full text |Cite
|
Sign up to set email alerts
|

On Super Mean Labeling for Total Graph of Path and Cycle

Abstract: Let G(V,E) be a graph with the vertex set V and the edge set E, respectively. By a graph G=(V,E) we mean a finite undirected graph with neither loops nor multiple edges. The number of vertices of G is called order of G and it is denoted by p. Let G be a (p,q) graph. A super mean graph on G is an injection f:V→{1,2,3…,p+q} such that, for each edge e=uv in E labeled by f⁎e=fu+f(v)/2, the set fV∪{f⁎e:e∈E} forms 1,2,3,…,p+q. A graph which admits super mean labeling is called super mean graph. The total graph T(G) … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 2 publications
0
2
0
Order By: Relevance
“…The total graph of path T (P n ), studied in [16], for super mean labeling. The total graph of path T (P 5 ) is shown in the Figure 2.…”
Section: B Total Graph Of Path T (Pn )mentioning
confidence: 99%
“…The total graph of path T (P n ), studied in [16], for super mean labeling. The total graph of path T (P 5 ) is shown in the Figure 2.…”
Section: B Total Graph Of Path T (Pn )mentioning
confidence: 99%
“…e classical meanness property of some graphs based on line graphs was considered in [5]. For some recent applications of the total graphs, see, e.g., [6][7][8].…”
Section: Introductionmentioning
confidence: 99%