Search
Now showing items 1-3 of 3
On the total H-irregularity strength of graphs: A new notion
(2018-02-28)
A total edge irregularity strength of G has been already widely studied in many
papers. The total -labeling is said to be a total edge irregular -labeling of the graph G if for
every two di erent edges e
1
and e
2
, ...
On the local edge antimagicness of m-splitting graphs
(2018-07-03)
Let G be a connected and simple graph. A split graph is a graph derived by adding
new vertex v
0
in every vertex v such that v
0
adjacent to v in graph G. An m-splitting graph
is a graph which has m v
0
-vertices, ...
Non-Isolated Resolving Number of Graphs with Homogeneous Pendant Edges
(2018-10-29)
A set is called a resolving set of if every vertices of have
diff erent r epr esentation. The minimum cardinalit y of resolving set is metric dimension, denoted by .
Furthermore, the resolving set of is called ...