Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Electronic Journal of Graph Theory and Applications (EJGTA)

The complete list of Ramsey $(2K_2,K_4)$-minimal graphs Kristiana Wijaya; Edy Tri Baskoro; Hilda Assiyatun; Djoko Suprijanto
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 3, No 2 (2015): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2015.3.2.9

Abstract

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$ induced by all blue edges contains a graph $H.$ A graph $F$ satisfying two conditions: $F \rightarrow (G,H)$ and $(F-e) \nrightarrow (G,H)$ for every $e \in E(F)$ is called a Ramsey $(G,H)-$minimal graph. In this paper, we determine all non-isomorphic Ramsey $(2K_2,K_4)$-minimal graphs.
Linear codes and cyclic codes over finite rings and their generalizations: a survey Djoko Suprijanto
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 2 (2023): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2023.11.2.11

Abstract

We survey a recent progress of cyclic codes over finite rings and their generalization to skew cyclic as well as skew cyclic codes with derivation over finite rings, focusing on structural properties of the codes. We also report recent developments on the construction methods of linear codes from graphs, in particular strongly regular as well as distance regular graphs.