Results 21 to 30 of about 15,285 (303)
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
Homomorphic image orders on combinatorial structures [PDF]
, 2015 Combinatorial structures have been considered under various orders, including substructure order and homomorphism order. In this paper, we investigate the homomorphic image order, corresponding to the existence of a surjective homomorphism between two ...
Ruskuc, Nik, Huczynska, Sophie
core +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
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
Moving forward with combinatorial interaction testing [PDF]
, 2013 Combinatorial interaction testing (CIT) is an efficient and effective method of detecting failures that are caused by the interactions of various system input parameters. In this paper, we discuss CIT, point out some of the difficulties of applying it in
Demiröz, Gülşen +5 more
core +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
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
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
Algorithmic aspects of combinatorial discrepancy [PDF]
, 2014 This chapter describes some recent results in combinatorial discrepancy theory motivated by designing efficient polynomial time algorithms for finding low discrepancy colorings. Until recently, the best known results for several combinatorial discrepancy
Srivastav, A. +3 more
core +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