Browsing by Title
Now showing items 40377-40396 of 87957
-
On The Development of Statistical Modeling in Plant Breeding: An Approach of Row-Column Interaction Models (RCIM) For Generalized AMMI Models with Deviance Analysis
(2017-03-23)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 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 development of the GE and the GGE interaction Biplot in the RCIM model and the evaluation of its’ robustness to the outlying observations
(2018-12-20)Our recent statistical research on modeling of the two-ways table data was focused especially on the robustness of Row Column Interaction Model (RCIM). It has been showed that the RCIM model provide better result in ... -
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 Existence of Non-Diregular Digraphs of Order Two less than the Moore Bound
(Jurnal Ilmu Dasar, 2011-01)A communication network can be modelled as a graph or a directed graph, where each processing element is represented by a vertex and the connection between two processing elements is represented by an edge (or, in case of ... -
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, ... -
On the Local Irregularity Vertex Coloring of Related Grid Graph
(International Journal of Academic and Applied Research (IJAAR), Vol. 4 Issue 2, February – 2020, Pages: 1-4, 2020-02-01)All graph in this paper is connected and simple graph. Let graph d(u,v) be a distance between any vertex u and v in graph ( ). A functio ( ) * +n is called vertex irregular k-labelling and ( ) where ... -
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} ... -
On The Local Metric Dimension of Line Graph of Special Graph
(2018-02-28)Let G be a simple, nontrivial, and connected graph. 𝑊 = {𝑤 } is a representation of an ordered set of k distinct vertices in a nontrivial connected graph G. The metric code of a vertex v, where 𝑣 ∈ G, the ordered ... -
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 ... -
On the locating domination number of corona product
(2018-07-04)Let G =(V (G),E(G) be a connected graph and v V (G). A dominating set for a graph G =(V, E) is a subset D of V such that every vertex not in D is adjacent to at least one member of D. The domination number γ(G) is the ... -
On The Metric Dimension with Non-isolated Resolving Number of Some Exponential Graph
(Proceeding The 1st IBSC: Towards The Extended Use Of Basic Science For Enhancing Health, Environment, Energy And Biotechnology, 2017-08-08)Let w, w ∈ G = (V, E). A distance in a simple, undirected and connected graph G, denoted by d(v, w), is the length of the shortest path between v and w in G. For an ordered set W = {w1, w2, w3, . . . , wk} of vertices and ... -
On the Metric-Location-Domination Number of Some Exponential Graphs
(The International Journal of Health, Education and Social (IJHES), 2019-11-30)On the Metric-Location-Domination Number of Some Exponential Graphs -
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 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 ... -
On the partition dimension and connected partition dimension of wheels
(Ars Combinatoria, 2007) -
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 ... -
On the r-Dynamic Chromatic Numberof Corona Product of Star Graph
(Thai Journal of Mathematics, 2022-10-01)A proper k coloring of graph G such that the neighbors of any vertex v ∈ V (G) where at least min{r, d(v)} different colors is defined an r-dynamic coloring. The minimum k such that graph G has an r-dynamic k coloring is ...