Results 11 to 20 of about 1,607,680 (300)

New techniques for cost sharing in combinatorial optimization games [PDF]

, 2010
Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for such games.
A. N. Letchford, CAPRARA, ALBERTO, Caprara, A, Letchford, A N   +3 more
core   +4 more sources

Preface to the Special Issue on “Combinatorial Optimization and Applications”

Mathematics
Combinatorial optimization is an area of mathematics, particularly operations research, that has attracted many researchers [...]
Anna Sciomachen
doaj   +2 more sources

Combinatorial representations [PDF]

, 2011
23pp. Submitted to J. Combinatorial Theory (Series A)arXiv:1109.1216v1 [math.CO]23pp. Submitted to J. Combinatorial Theory (Series A)23pp. Submitted to J.
Maximilien Gadouleau, Cameron, PJ, Gadouleau, M, Riis, S, Cameron, Peter J., Riis, Soren, Gadouleau, Maximilien, Cameron, Peter Jephson, Riis, Søren, Søren Riis, Peter J. Cameron, Cameron, Peter Jephson; id_orcid   +11 more
core   +1 more source

AUTOMORPHISM GROUPS OF MAPS, SURFACES AND SMARANDACHE GEOMETRIES [PDF]

, 2005
A combinatorial map is a connected topological graph cellularly embedded in a surface. As a linking of combinatorial configuration with the classical mathematics, it fascinates more and more mathematician’s interesting.
Linfan Mao, MAO, LINFAN
core   +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, Edy Tri Baskoro, Suhadi Wido Saputro   +2 more
doaj   +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, Hilda Assiyatun, Edy Tri Baskoro   +2 more
doaj   +1 more source

An introduction to Smarandache multi-spaces and mathematical combinatorics [PDF]

, 2007
These Smarandache spaces are right theories for objectives by logic. However, the mathematical combinatorics is a combinatorial theory for branches in classical mathematics motivated by a combinatorial speculation.
Linfan Mao, Mao. Linfan
core   +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, Edy Tri Baskoro, Suhadi Wido Saputro   +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, Gray, Robert, Carvalho, Catarina, CATARINA CARVALHO, Gray, R, Gray, Robert D., NIK RUSKUC, ROBERT D. GRAY, Carvalho, C.A., Ruskuc, Nik; id_orcid   +9 more
core   +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, Edy Tri Baskoro, Suhadi Wido Saputro   +2 more
doaj   +1 more source