Browsing by Title
Now showing items 40381-40400 of 87941
-
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 ... -
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 rainbow coloring for some graph operations
(2018-02-28)Let G = (V, E) be a nontrivial, finite, simple and undirected connected graph on which is defined a coloring f : E(G) → {1,2, …, k}, k ∈ N. The adjacent edges may be colored the same colors. A path in an edge colored graph ... -
On the Rainbow Vertex Connection Number of Edge Comb of Some Graph
(Proceeding The 1st IBSC: Towards The Extended Use Of Basic Science For Enhancing Health, Environment, Energy And Biotechnology, 2017-08-08)By an edge comb, we mean a graph formed by combining two graphs G and H, where each edge of graph G is replaced by the which one edge of graph H, denote by G D H. A vertex colored graph G D H = (V (G D H), E(G D H)) ... -
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 total rainbow connection of the wheel related graphs
(2018-07-04)Let G = (V (G); E(G)) be a nontrivial connected graph with an edge coloring c : E(G) ! f1; 2; :::; lg; l 2 N, with the condition that the adjacent edges may be colored by the same colors. A path P in G is called rainbow ... -
On The Uncomputerized Direct Shear Apparatus
(2013-10-08)Reliability and accuracy of un-computerized direct shear apparatus which is manually in both test running and data acquisition were observed. Step by step of the direct shear test was examined closely to investigate 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 ... -
On Total Vertex Irregularity Strength Cocktail Party Graphs
(Jurnal Ilmu Dasar, 2011-01)A vertex irregular total k-labeling of a graph G is a function λ from both the vertex and the edge sets to {1,2,3,,k} such that for every pair of distinct vertices u and x, λ(u)+ Σλ(uv) ≠ λ(x)+ Σλ(xy). The integer k is ... -
On two conjectures concerning vertex magic total labelings of generalized Petersen graphs
(Bulletins of ICA, 2001)A vertex-magic total labeling of a graph with $v$ vertices and $e$ edges is defined as a one-to-one map taking the vertices and edges onto the integers $1,2,\dots ,v+e$ with the property that the sum of the label on a ... -
On vertex-magic total labeling of some wheel related graphs
(Utilitas Math., 2007)Let G be a graph with vertex set V = V (G) and edge set E = E(G) and let e = jE(G)j and v = jV (G)j. A one-to-one map ¸ from V [ E onto the integers f1; 2; : : : ; v + eg is called vertex-magic total labeling if there ... -
One Edmund Pevensie ’ s Betrayayalina Peacock’ s Movie Script the Chronicles of Narnia : The lion, The witch and The Wardrobe
(2014-01-25)The Chronicles of Narnia: the Lion, the Witch and the Wardrobe is a movie script written by Ann Peacock. It tells about betrayal of the character, Edmund and also its influence on other characters and himself. Edmund ... -
One of the crucial targets to reduce the mortality of infants and under-five year infants were run Posyandu. The health volunteers’ role performance had so far provided a great influence toward the successly of Posyandu. High motivation had obviously provided essential effect for health volunteers’ role performance, so that it had contributed to the success of Posyandu. The Posyandu as a community empowerment form was set up based on the partnership to reach autonomy community. The purpose of this research was to know the correlation between Posyandu health volunteers’ motivation and their role performance in Sumbersari villlage of Sumbersari district in Jember regency. The research methodology used an observational analytical design with cross sectional approarch. The number of research sample were 69 health volunteers selected by means of multistage random sampling technique. The research data were taken from the questionaire and analyzed by chi square test. The research result showed that there were at least 36 volunteers having high motivation, and 27 of them (75%) had done their role effectively, but 9 of them (25%) had not. The statistical test result showed that p value 0.003 and OR 5.25 indicated that there was correlation with positive association. It is hopefully expected that the health volunteers have to take active roles to perform their role performance.
(2013-12-10)Dysmenorrhea is menstrual pain caused by uterus muscle spasms. There are 64,25% dysmenorrhea secondary incidences and 54,89% dysmenorrhea primary incidences. Dysmenorrhea could make somebody left their activity to take ...