Results 11 to 20 of about 6,840 (159)
Locating-Chromatic Number of Amalgamation of Stars
Journal of Mathematical and Fundamental Sciences, 2013 Let G be a connected graph and c a proper coloring of G . For i Æ’1,2,Æ’»,k define the color class i C as the set of vertices receiving color i . The color code c (v) "ž¨ of a vertex v in G is the ordered k -tuple 1 ( ( , ), , ( , )) k d v C Æ’» d v C ...
Asmiati Asmiati +2 more
doaj +1 more source
Ramsey minimal graphs for a pair of a cycle on four vertices and an arbitrary star
Electronic Journal of Graph Theory and Applications, 2022 Let F, G and H be simple graphs. The notation F → (G, H) means that for any red-blue coloring on the edges of graph F, there exists either a red copy of G or a blue copy of H.
Maya Nabila +2 more
doaj +1 more source
On size multipartite Ramsey numbers for stars versus paths and cycles
Electronic Journal of Graph Theory and Applications, 2017 Let $K_{l\times t}$ be a complete, balanced, multipartite graph consisting of $l$ partite sets and $t$ vertices in each partite set. For given two graphs $G_1$ and $G_2$, and integer $j\geq 2$, the size multipartite Ramsey number $m_j(G_1,G_2)$ is the ...
Anie Lusiani +2 more
doaj +1 more source
A method to construct graphs with certain partition dimension
Electronic Journal of Graph Theory and Applications, 2019 In this paper, we propose a method for constructing new graphs from a given graph G so that the resulting graphs have the partition dimension at most one larger than the partition dimension of the graph G.
Debi Oktia Haryeni +2 more
doaj +1 more source
Modular Irregular Labeling on Double-Star and Friendship Graphs
Journal of Mathematics, 2021 A modular irregular graph is a graph that admits a modular irregular labeling. A modular irregular labeling of a graph G of order n is a mapping of the set of edges of the graph to 1,2,…,k such that the weights of all vertices are different.
K. A. Sugeng +3 more
doaj +1 more source
On the restricted size Ramsey number for P3 versus dense connected graphs
Electronic Journal of Graph Theory and Applications, 2020 Let F, G and H be simple graphs. A graph F is said a (G,H)-arrowing graph if in any red-blue coloring of edges of F we can find a red G or a blue H. The size Ramsey number of G and H, ŕ(G,H), is the minimum size of F.
Denny Riama Silaban +2 more
doaj +1 more source
Non-Isolated Resolving Sets of Corona Graphs with Some Regular Graphs
Mathematics, 2022 Let G be a connected, simple, and finite graph. For an ordered set W={w1,w2,…,wk}⊆V(G) and a vertex v of G, the representation of v with respect to W is the k-vector r(v|W)=(dG(v,w1),…,dG(v,wk)).
Wahyuni Abidin +2 more
doaj +1 more source
On The Partition Dimension of Disconnected Graphs
Journal of Mathematical and Fundamental Sciences, 2017 For a graph G=(V,E), a partition Ω=\{O_1,O_2,…,O_k \} of the vertex set V is called a resolving partition if every pair of vertices u,v∈V(G) have distinct representations under Ω.
Debi Oktia Haryeni +2 more
doaj +1 more source
Restricted size Ramsey number for path of order three versus graph of order five
Electronic Journal of Graph Theory and Applications, 2017 Let $G$ and $H$ be simple graphs. The Ramsey number for a pair of graph $G$ and $H$ is the smallest number $r$ such that any red-blue coloring of edges of $K_r$ contains a red subgraph $G$ or a blue subgraph $H$.
Denny Riama Silaban +2 more
doaj +1 more source
On the Restricted Size Ramsey Number Involving a Path P3
Discussiones Mathematicae Graph Theory, 2019 For any pair of graphs G and H, both the size Ramsey number ̂r(G,H) and the restricted size Ramsey number r*(G,H) are bounded above by the size of the complete graph with order equals to the Ramsey number r(G,H), and bounded below by e(G) + e(H) − 1 ...
Silaban Denny Riama +2 more
doaj +1 more source