Search
Now showing items 11-20 of 22
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 Π = ...
The Effectiveness of Research-Based Learning With Computer Programming and Highly Interactive Cloud Classroom (Hic) Elaboration in Improving Higher Order Thinking Skills in Solving a Combination of Wave Functions
(IOP Conf. Series: Journal of Physics, 2019-05-07)
The aim of this research was to compare the HIC (Highly interactive
classroom) system with a traditional method of teaching superposition of wave functions
courses especially. In order to examine it’s learning effectiveness ...
On the Local Multiset Dimension of Graph With Homogenous Pendant Edges
(Journal of Physics: Conference Series, 2019-12-01)
Let G be a connected graph with E as edge set and V as vertex set . rm(v|W) =
{d(v, s1), d(v, s2), . . . , d(v, sk)} is the multiset representation of a vertex v of G with respect to
W where d(v, si) is a distance between ...
Elegant Labeling Of Some Graphs
(Journal of Physics: Conference Series, 2020-12-01)
In this paper, we introduce a new notion of graph theory study, namely a local
edge metric dimension. It is a natural extension of metric dimension concept. dG(e, v) =
min{d(x, v), d(y, v)} is the distance between the ...
The Local (Adjacency) Metric Dimension of Split Related Complete Graph
(IOP Conf. Series: Journal of Physics: Conf. Series, 2019-04-01)
Let G be a simple graph. A set of vertices, called V (G) and a set of edges, called
E(G) are two sets which form graph G. W is a local adjacency resolving set of G if for every
two distinct vertices x, y and x adjacent ...
Elegant Labeling of Some Graphs
(Journal of Physics: Conference Series, 2020-06-19)
An elegant labeling on graph G with vertices and edges is an injective
(one-to-one) mapping from the set of vertices V (G) to the set of non-negative integers
f0; 1; 2; 3; :::; g in such a way that the set of values ...
On Local Irregularity of the Vertex Coloring of the Corona Product of a Tree Graph
(Jurnal Bioindustri, 2022)
Let G = (V, E) be a graph with a vertex set V and an edge set E. The graph G is said to be with a local irregular vertex coloring if there is a function f called a local irregularity vertex coloring with the properties: ...
Local Distance Irregular Labeling of Graphs
(TWMS Journal of Applied and Engineering Mathematics, 2023)
We introduce the notion of distance irregular labeling, called the local distance ir regular labeling. We define λ : V (G) −→ {1, 2, . . . , k} such that the weight calculated at the vertices induces a vertex coloring if ...
On the local irregularity vertex coloring of volcano, broom, parachute, double broom and complete multipartite graphs
(World Scientific Publishing Company, 2021-09-05)
Let G = (V,E) be a simple, finite, undirected, and connected graph with vertex set V (G) and edge set E(G). A bijection l : V (G) → {1, 2,...,k} is label function l if opt(l) = min{max(li) : li vertex irregular labeling} ...