Search
Now showing items 11-20 of 27
On The Packing k-Coloring of Unicyclic Graph Family
(International Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 1, January – 2020, Pages: 1-9, 2020-01-09)
All graph in this paper is connected graph. Let
du,v
be a distance between any vertex
u
and
v
in graph
GV,E.
A function
c :VG 1, 2, , k
is called a packing
k coloring if every two vertex of color
i
are ...
The Lower Bound of the r-Dynamic Chromatic Number of Corona Product by Wheel Graphs
(AIP Conf. Proc. 2014, 020054-1–020054-7, 2018-09-21)
The dynamic coloring of a graph G is proper coloring such that every vertex of G with degree has at least two
neighbors that are colored differently. A generalization of the dynamic coloring was also introduced by Montgomery ...
On The Rainbow Antimagic Connection Number of Some Wheel Related Graphs
(International Journal of Academic and Applied Research (IJAAR), Vol.3 Issue 12, December – 2019, Pages: 60-64, 2019-12-01)
All graphs in this paper is connected and simple. Let ( ) be a connected and simple graph with vertices set and
edge set . A bijection function * | ( )|+ is called an edge antimagic vertex ...
On The Packing k-Coloring of Edge Corona Product
(International Journal of Academic and Applied Research (IJAAR), Vol. 3 Issue 12, December – 2019, Pages: 55-59, 2019-12-01)
All graph in this paper is connected and simple graph. Let
du,v
be a distance between any vertex
u
and
v
in graph
G V,E
. A function
c :VG1, 2,, k
is called a packing k-coloring if every two vertices ...
On the Chromatic Number Local Irregularity of Related Wheel Graph
(IOP Conf. Series: Journal of Physics: Conf. Series 1211 (2019) 012003, 2019-05-07)
A function f is called a local irregularity vertex coloring if (i) l : V (G) !
f1; 2; ; kg as vertex irregular k-labeling and w : V (G) ! N, for every uv 2 E(G); w(u)
6= w(v)
where w(u) = v2N(u)l(v) and (ii) ...
Resolving Domination Number of Graphs
(Discrete Mathematics, Algorithms and Applications, Vol. 11, No. 6 (2019) 1950071, 2019-11-05)
For a set W =
{
s1,s2,...,sk
of vertices of a graph G, the representation multiset of
a vertexv of G with respect to W is r(v
|
W ) =
{
d(v, s1),d(v, s2),...,d(v, sk)
}
, where
d(v, si) is a distance between of ...
Metric Chromatic Number of Unicyclic Graphs
(INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 06, JUNE 2019, 2019-06-09)
All graphs in this paper are nontrivial and connected graph. Let 𝑓 ∶ 𝑉 (𝐺) → *1,2, … , 𝑘+ be a vertex coloring of a graph 𝐺where two adjacent
vertices may be colored the same color. Consider the color classes Π = ...
On the r-Dynamic Chromatic Number of the Corronation by Complete Graph
(IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018) 012033, 2018-04-27)
In this paper we will study the r-dynamic chromatic number of the coronation
by complete graph. A proper k-coloring of graph G such that the neighbors of any vertex v
receive at least minfr; d(v)g di®erent colors. The ...
Some Families of Tree Are Elegant
(Advances in Mathematics: Scientific Journal 9, 2020-12-04)
An elegant labeling on the graph G with n vertex and m edge is a
one-to-one mapping (injection function) of the vertex set V (G) to the set of non
negative integers {0, 1, 2, 3, . . . , m} such that each edge gets the ...
On Total r-Dynamic Coloring of Several Classes of Graphs and Their Related Operations
(roceeding The 1st IBSC: Towards The Extended Use Of Basic Science For Enhancing Health, Environment, Energy And Biotechnology, 2017-08-08)
All graphs in this paper are simple, connected and undirected. Let r, k be natural numbers. By a proper
k-coloring of a graph G, we mean a map c : V (G) → S, where |S| = k, such that any two adjacent vertices receive ...