Browsing LSP-Jurnal Ilmiah Dosen by Title
Now showing items 4236-4255 of 7282
-
ON METRIC DIMENSION OF EDGE-CORONA GRAPHS
(2017-11-30)This paper discusses some characterization and exact values for metric dimension of edge-corona from a connected graph not tree G with an arbitrary nontrivial graph H. -
On r-Dynamic Chromatic Number of the Corronation of Path and Several Graphs
(International Journal of Advanced Engineering Research and Science (IJAERS), [Vol-4, Issue-4, Apr- 2017], 2017-04-09)This study is a natural extension of k -proper coloring of any simple and connected graph G. By a n rdynamic coloring of a graph G, we mean a proper k coloring of graph G such that the neighbors of any vert ... -
On r-dynamic coloring of some graph operations
(2018-03-07)Let G be a simple, connected and undirected graph. Given r; k as any natural numbers. By an r-dynamic k-coloring of graph G, we mean a proper k-coloring c(v) of G such that jc(N(v))j minfr; d(v)g for each vertex v in ... -
On r-dynamic vertex coloring of some flower graph families
(World Scientific Publishing Company, 2021-03-03)e a simple, connected undirected graph with m vertices and n edges. Let ver tex coloring c of a graph G be a mapping c : V (G) → S, where |S| = k and it is k-colorable. Vertex coloring is proper if none of the any two ... -
On Rainbow k-Connection Number of Special Graphs and It's Sharp Lower Bound
(2018-02-28)Let G = (V; E) be a simple, nontrivial, nite, connected and undirected graph. Let c be a coloring c : E(G) ! f1; 2; : : : ; sg; s 2 N. A path of edge colored graph is said to be a rainbow path if no two edges on the ... -
On Ramsey (4K2, P3)-minimal graphs
(AKCE International Journal of Graphs and Combinatorics, 2018-08-13)Let F, G, and H be simple graphs. We write F → (G, H) to mean that any red–blue coloring of all edges of F will contain either a red copy of G or a blue copy of H. A graph F (without isolated vertices) satisfying F → (G, ... -
On Ramsey (mK2, H)-Minimal Graphs
(Graphs and Combinatorics, 2017-01-02)Let R(G, H) denote the set of all graphs F satisfying F → (G, H) and for every e ∈ E(F), (F − e) (G, H). In this paper, we derive the necessary and sufficient conditions for graphs belonging to R(mK2, H) for any graph ... -
On Ramsey Minimal Graphs for a 3-Matching Versus a Path on Five Vertices
(Proceedings of the International Conference on Mathematics, Geometry, Statistics, and Computation, 2022-02-08)Let 𝐺, 𝐻, and 𝐹 be simple graphs. The notation 𝐹 ⟶ (𝐺, 𝐻) means that any red-blue coloring of all edges of 𝐹 contains a red copy of 𝐺 or a blue copy of 𝐻. The graph 𝐹 satisfying this property is called a Ramsey ... -
On strengthening the local politics to the realization of rural quality education sustainable development goals
(IOP Conf. Series: Earth and Environmental Science, 2022-12-20)The Sustanaible development goals (SDGS) has been popular since 2015. SDG has abig agenda to elevate human dignity. SDGS has 17 strategic agendas where one of them isquality education. The quality education agenda must ... -
On super (a, d) − P2 B H− antimagic total labeling of disjoint union of comb product graphs
(antimagic total labeling of disjoint union of comb product graphs, 2019-05-07)This study focuses on simple and undirected graphs. For a graph G = (V, E), a bijection λ from V (G)∪E(G) into {1, 2, ..., |V (G)|+|E(G)|} is called super (a, d)-H-antimagic total labeling of G if the total P2BH−weights, ... -
On Super (a,d)-Edge Antimagic Total Labeling of Some Generalized Shackle of Fan Graph
(International Journal of Academic and Applied Research (IJAAR), 2022-04-01)Generalized shackle of fan graph is the development of shackle operation of fan graph 𝑭𝒏 by connecting the some vertices in shackle of fan graph. Graph G with the cardinality of vertex p and the cardinality of edges q ... -
On Super Edge Local Antimagic Total Labeling by Using an Edge Antimagic Vertex Labeling Technique
(2019-07-25)In this paper, we consider that all graphs are finite, simple and connected. Let G(V,E) be a graph of vertex set V and edge set E. By a edge local antimagic total labeling, we mean a bijection f:V(G)∪E(G)→{1,2,3,...,|V(G)|+|E(G)|} ... -
On super H-Antimagicness of an Edge Comb Product of Graphs with Subgraph as a Terminal of its Amalgamation
(2018-02-28)All graphs in this paper are simple, nite, and undirected graph. Let r be a edges of H. The edge comb product between L and H, denoted by LB H, is a graph obtained by taking one copy of L and jE(L)j copies of H and ... -
On the ascending subgraph decomposition problem for bipartite graphs
(2017-09-11)The Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph G with n+1 2 edges admits an edge decomposition G = H has i edges and is isomorphic to a subgraph of H i+1 1 ⊕· · · ⊕H , i = 1, ... -
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) ... -
On The Development of Statistical Modeling in Plant Breeding: An Approach of Row-Column Interaction Models (RCIM) For Generalized AMMI Models with Deviance Analysis
(Agriculture and Agricultural Science Procedia, 2016-12-02)Generalized AMMI (GAMMI) model has been widely used to model the Genotype × Environment Interaction (GEI) with categorical (or in general, non-normal) response variables. It was developed by introduce the concept of ... -
On the Domination Number of Some Graph Operations
(2016-02-02)A set $D$ of vertices of a simple graph $G$, that is a graph without loops and multiple edges, is called a dominating set if every vertex $u\in V(G)-D$ is adjacent to some vertex $v\in D$. The domination number of a ... -
On the Henstock-Kurzweil Integral of C [a; b] Space-valued Functions
(International Journal of Mathematical Analysis Vol. 9, 2015, no. 37, 1831 - 1846, 2015-09-01)There have been many contributions to the study of integration for mappings, taking values in ordered spaces. Among the authors, we quote Rie˘can [8], Duchon and Rie˘can [5], Rie˘can and Vr´abelov´a [9]. Henstock-Kurzw ... -
On The LDS of the Joint Product of Graphs
(2019-09-02)Locating dominating set (LDS) is one of the topics of graph theory. A set VD of vertices in graph G is called a dominating set if every vertex V u is either an element of D or adjacent to some element ... -
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, ...