Results 21 to 30 of about 1,365,580 (287)
AKCE International Journal of Graphs and Combinatorics, 2018 Let and be simple graphs. We write to mean that any red–blue coloring of all edges of will contain either a red copy of or a blue copy of A graph (without isolated vertices) satisfying and for each is called a Ramsey -minimal graph. The set of all Ramsey
Kristiana Wijaya +3 more
doaj +2 more sources
The geodetic domination number of comb product graphs
Electronic Journal of Graph Theory and Applications, 2020 A subset S of vertices in graph G is called a geodetic set if every vertex in V(G) \ S lies on a shortest path between two vertices in S. A subset S of vertices in G is called a dominating set if every vertex in V(G) \ S is adjacent to a vertex in S ...
Dimas Agus Fahrudin, Suhadi Wido Saputro
doaj +1 more source
Presentations of inverse semigroups, their kernels and extensions [PDF]
, 2011 "Part of this work was done while Gray was an EPSRC Postdoctoral Research Fellow at the University of St Andrews, Scotland"Let S be an inverse semigroup and let π:S→T be a surjective homomorphism with kernel K.
Ruskuc, Nik +8 more
core +1 more source
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
On Size Bipartite and Tripartite Ramsey Numbers for The Star Forest and Path on 3 Vertices
Journal of Mathematical and Fundamental Sciences, 2020 For simple graphs G and H the size multipartite Ramsey number mj(G,H) is the smallest natural number t such that any arbitrary red-blue coloring on the edges of Kjxt contains a red G or a blue H as a subgraph.
Anie Lusiani +2 more
doaj +1 more source
A unified approach to combinatorial key predistribution schemes for sensor networks [PDF]
, 2012 There have been numerous recent proposals for key predistribution schemes for wireless sensor networks based on various types of combinatorial structures such as designs and codes.
Paterson, Maura B. +3 more
core +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