Results 21 to 30 of about 7,217 (255)
Trees with Certain Locating-chromatic Number
Journal of Mathematical and Fundamental Sciences, 2016 The locating-chromatic number of a graph G can be defined as the cardinality of a minimum resolving partition of the vertex set V(G) such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices in G are ...
Dian Kastika Syofyan +2 more
doaj +1 more source
Rainbow connection number of comb product of graphs
Electronic Journal of Graph Theory and Applications, 2022 An edge-colored graph G is called a rainbow connected if any two vertices are connected by a path whose edges have distinct colors. Such a path is called a rainbow path.
Dinny Fitriani +2 more
doaj +1 more source
The complete list of Ramsey $(2K_2,K_4)$-minimal graphs
Electronic Journal of Graph Theory and Applications, 2015 Let $F, G,$ and $H$ be non-empty graphs. The notation $F \rightarrow (G,H)$ means that if all edges of $F$ are arbitrarily colored by red or blue, then either the subgraph of $F$ induced by all red edges contains a graph $G$ or the subgraph of $F ...
Kristiana Wijaya +3 more
doaj +1 more source
Restricted Size Ramsey Number Involving Matching and Graph of Order Five
Journal of Mathematical and Fundamental Sciences, 2020 Harary and Miller (1983) started the research on the (restricted) size Ramsey number for a pair of small graphs. They obtained the values for some pairs of small graphs with order not more than four.
Denny Riama Silaban +2 more
doaj +1 more source
The total vertex irregularity strength of symmetric cubic graphs of the Foster's Census
Indonesian Journal of Combinatorics, 2022 Foster (1932) performed a mathematical census for all connected symmetric cubic (trivalent) graphs of order n with n ≤ 512. This census then was continued by Conder et al. (2006) and they obtained the complete list of all connected symmetric cubic graphs
Rika Yanti +3 more
doaj +1 more source
On the inverse graph of a finite group and its rainbow connection number
Electronic Journal of Graph Theory and Applications, 2023 A rainbow path in an edge-colored graph G is a path that every two edges have different colors. The minimum number of colors needed to color the edges of G such that every two distinct vertices are connected by a rainbow path is called the rainbow ...
Rian Febrian Umbara +2 more
doaj +1 more source
On Ramsey (2K2, Wn)-minimal graphs of smallest order
Electronic Journal of Graph Theory and ApplicationsThe notation F → (H, G) means that if all edges of F are arbitrarily colored by red or blue, then either the subgraph of F induced by all red edges contains a graph H or the subgraph of F induced by all blue edges contains a graph G.
Muhammad Rafif Fajri +2 more
doaj +1 more source
All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3
Heliyon, 2020 All graphs of order n with partition dimension 2, n−2, n−1, or n have been characterized. However, finding all graphs on n vertices with partition dimension other than these above numbers is still open.
Edy Tri Baskoro, Debi Oktia Haryeni
doaj +1 more source
Hadamard matrices of order 36 and double-even self-dual [72,36,12] codes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Before this work, at least 762 inequivalent Hadamard matrices of order 36 were known. We found 7238 Hadamard matrices of order 36 and 522 inequivalent [72,36,12] double-even self-dual codes which are obtained from all 2-(35,17,8) designs with an ...
Iliya Bouyukliev +2 more
doaj +1 more source
The locating-chromatic number for Halin graphs
Communications in Combinatorics and Optimization, 2017 Let $G$ be a connected graph. Let $f$ be a proper $k$-coloring of $G$ and $\Pi=\{R_1,R_2,\ldots, R_k\}$ be an ordered partition of $V(G)$ into color classes. For any vertex $v$ of $G,$ define the {\em color code} $c_\Pi(v)$ of $v$ with respect to $\
I.A. Purwasih +4 more
doaj +1 more source