Results 21 to 30 of about 156 (148)

Vertex colorings without rainbow subgraphs

Discussiones Mathematicae Graph Theory, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wayne Goddard, Honghai Xu
openaire   +2 more sources

Some Results on the Rainbow Vertex-Disconnection Colorings of Graphs

SSRN Electronic Journal, 2022
Let $G$ be a nontrivial connected and vertex-colored graph. A vertex subset $X$ is called rainbow if any two vertices in $X$ have distinct colors. The graph $G$ is called \emph{rainbow vertex-disconnected} if for any two vertices $x$ and $y$ of $G$, there exists a vertex subset $S$ such that when $x$ and $y$ are nonadjacent, $S$ is rainbow and $x$ and $
openaire   +2 more sources

Rainbow Vertex Antimagic Coloring 2-Connection paada Keluarga Graf Tangga

CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS, 2022
All graph in this paper are connected graph and simple graph. Let G = (V,E)be a connected graph. Rainbow vertex connection is the assignment of G that has interior vertices with different colors. The minimum number of colors from the rainbow vertex coloring in graph G is called rainbow vertex connection number.
Ahmad Musyaffa' Hikamuddin, Dafik Dafik, Rafiantika Megahnia Prihandini   +2 more
openaire   +1 more source

The Development of Research-Based Learning Tools with a STEM Approach to Improve Metaliteracy Skills to Solve Rainbow Vertex Anti-magic Coloring Problems

Pancaran Pendidikan, 2022
Metaliteracy is the framing and strengthening of information literacy based on critical and creative thinking. Metaliteracy indicators include generating, combining, using, participating, sharing, and collaborating. To implement higher-order thinking skills, we implement research-based learning with a STEM approach.
Qurrotul A’yun, Slamin Slamin, Dafik Dafik   +2 more
openaire   +1 more source

An updated survey on rainbow connections of graphs - a dynamic survey

Theory and Applications of Graphs, 2017
The concept of rainbow connection was introduced by Chartrand, Johns, McKeon and Zhang in 2008. Nowadays it has become a new and active subject in graph theory. There is a book on this topic by Li and Sun in 2012, and a survey paper by Li, Shi and Sun in
Xueliang Li, Yuefang Sun
doaj   +1 more source

The Development of RBL-STEM Learning Materials to Improve Students’ Computational Thinking Skills in Solving Rainbow Vertex Antimagic Coloring Problems and It’s Application for Batik Motif Design

International Journal of Current Science Research and Review, 2023
Computational thinking is thinking process that is needed in formulating problems and solutions, so that these solutions can be effective information processing agents in solving problems. Indicators of computational thinking consist of problem decomposition, algorithmic thinking, pattern recognition, abstraction and generalization.
Dahlan Irawan, Dafik ., I Made Tirta
openaire   +2 more sources

The Development of RBL – STEM Learning Materials to Improve Student’s Conjecturing Thinking Skills in Solving Rainbow Vertex Antimagic Coloring Promblems and it’s Application to Supply Chain Management Using ANN

International Journal of Current Science Research and Review, 2023
One of the educational developments in recent years has to do with STEM. The term STEM (Science, Technology, Engineering, and mathematics) is one approach in the learning process that is quite influential to be used today. STEM-based learning focuses students on solving problems in everyday life by combining the four fields of science: science ...
Hidayati, Nur Laili, Dafik, Arika Indah Kristiana   +2 more
openaire   +2 more sources

Rainbow Connectivity Using a Rank Genetic Algorithm: Moore Cages with Girth Six

Journal of Applied Mathematics, 2019
A rainbow t-coloring of a t-connected graph G is an edge coloring such that for any two distinct vertices u and v of G there are at least t internally vertex-disjoint rainbow (u,v)-paths.
J. Cervantes-Ojeda, M. Gómez-Fuentes, D. González-Moreno, M. Olsen   +3 more
doaj   +1 more source

Vertex Colorings without Rainbow or Monochromatic Subgraphs

, 2016
This paper investigates vertex colorings of graphs such that some rainbow subgraph~$R$ and some monochromatic subgraph $M$ are forbidden. Previous work focussed on the case that $R=M$. Here we consider the more general case, especially the case that $M=K_2$.
Goddard, Wayne, Xu, Honghai
openaire   +3 more sources

Rainbow connection number of amalgamation of some graphs

AKCE International Journal of Graphs and Combinatorics, 2016
Let G be a nontrivial connected graph. For k∈N, we define a coloring c:E(G)→{1,2,…,k} of the edges of G such that adjacent edges can be colored the same. A path P in G is a rainbow path if no two edges of P are colored the same. A rainbow path connecting
D. Fitriani, A.N.M. Salman
doaj   +1 more source