Browsing by Title
Now showing items 40361-40380 of 87991
-
On Generalization of Additive Main Effect and Multiplicative Interaction (AMMI) Models: An Approach of Row Column Interaction Models for Counting Data
(MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES, 2017-08-12)Additive Main Effect and Multiplicative Interaction (AMMI) model was commonly used to analyze Genotype Environment × Interaction with normal response variables, now it had been generalized for categorical or other ... -
on Graceful Chromatic Number of Vertex amalgamation of Tree Graph Family
(CAUCHY –Jurnal Matematika Murni dan Aplikasi, 2022-08-13)Definition graceful k-coloring of graph 𝐺 = (𝑉, 𝐸) is proper vertex coloring 𝑐: 𝑉(𝐺) → {1,2, … , 𝑘); 𝑘 ≥ 2, which induces a proper edge coloring 𝑐′: 𝐸(𝐺) → {1,2, … , 𝑘 − 1} defined 𝑐 ′ (𝑢𝑣) = |𝑐(𝑢) − ... -
On H-Supermagic Labelings of m-Shadow of Paths and Cycles
(2019-03-04)The labeling f is called super if the smallest possible labels appear on the vertices. A graph that admits (super) (a,d)-H-antimagic total labeling is called (super) (a,d)-H-antimagic. -
On inclusive 1-Distance Vertex Irregularity Strength of Firecracker, Broom, and Banana Tree
(Proceedings of the International Conference on Mathematics and Islam, 2020-03-03)Let k be a natural number and G be a simple graph. An inclusive d-distance vertex irregular labelling of a graph G is a function 𝜆: 𝑉(𝐺) ⟶ {1,2, … , 𝑘} so that the weights at each vertex are different. Let v be a vertex ... -
On inclusive distance vertex irregularity strength of small identical copies of star graphs
(Journal of Physics: Conference Series, 2021-05-14)For a simple graph G, an inclusive distance vertex irregular k-labeling of G is a mapping λ : V (G) → {1, 2, . . . , k} such that all the vertex-weights are pairwise distinct, where the weight of a vertex v, denoted by ... -
On Local Adjacency Metric Dimension of Some Wheel Related Graphs with Pendant Points
(2017-12-04)Let G =(V(G),E(G)) be any connected graph of order n = |V(G)| and measure m = |E(G)|. For an order set of vertices S = { s 1 , s 2 , ..., s k } and a vertex v in G, the adjacency representation of v with respect to ... -
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: ... -
On locating independent domination number of amalgamation graphs
(2018-02-28)An independent set or stable set is a set of vertices in a graph in which no two of vertices are adjacent. A set D of vertices of graph G is called a dominating set if every vertex u 2 V (G) ¡ D is adjacent to some vertex ... -
On Max-Plus Algebra and Its Application on Image Steganography
(The Scientifc World Journal, 2018-05-15)We propose a new steganography method to hide an image into another image using matrix multiplication operations on max plus algebra. Tis is especially interesting because the matrix used in encoding or information disguises ... -
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
(2016-02-02)Let $G$ be a simple, connected and undirected graph. Let $r,k$ be natural number. By a proper $k$-coloring of a graph $G$, we mean a map $ c : V (G) \rightarrow S$, where $|S| = k$, such that any two adjacent vertices ... -
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 (3K2,K3)−minimal graphs
(AIP Conference Proceedings, 2016-02-24)The Ramsey graph theory has many interesting applications, such as in the fields of communications, information retrieval, and decision making. One of growing topics in Ramsey theory is Ramsey minimal graph. For any given ... -
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 (mK2, P4)-Minimal Graphs
(Atlantis Press, 2021)Let 𝐹, 𝐺, and 𝐻 be simple graphs. The notation 𝐹 → (𝐺, 𝐻) means that any red-blue coloring of all edges of 𝐹 will contain either a red copy of 𝐺 or a blue copy of 𝐻. Graph 𝐹 is a Ramsey (𝐺, 𝐻)-minimal if 𝐹 → ... -
On Ramsey (𝒎𝑲𝟐,𝑷𝟒)-Minimal Graphs
(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 𝐹 will contain either a red copy of 𝐺 or a blue copy of 𝐻. Graph 𝐹 is a Ramsey (𝐺, 𝐻)-minimal if 𝐹 → ...