Results 21 to 30 of about 37,501 (244)
Combinatorial optimization in networks with Shared Risk Link Groups [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The notion of Shared Risk Link Groups (SRLG) captures survivability issues when a set of links of a network may fail simultaneously. The theory of survivable network design relies on basic combinatorial objects that are rather easy to compute in the ...
David Coudert +3 more
doaj +1 more source
Transactions of the American Mathematical Society, 2006 In this paper we extend the block combinatorics partition theorems of Hindman and Milliken in the setting of the recursive system of the block Schreier families (B^xi) consisting of families defined for every countable ordinal xi. Results contain (a) a block partition Ramsey theorem for every countable ordinal xi (Hindman's theorem corresponding to xi ...
Farmaki, V., Negrepontis, S.
openaire +4 more sources
On Proper (Strong) Rainbow Connection of Graphs
Discussiones Mathematicae Graph Theory, 2021 A path in an edge-colored graph G is called a rainbow path if no two edges on the path have the same color. The graph G is called rainbow connected if between every pair of distinct vertices of G, there is a rainbow path.
Jiang Hui +3 more
doaj +1 more source
Neutrosophic combinatorics and its applications [PDF]
, 2000 Based on the combined method in Chinese ancient I-Ching and theory of Taiji, this paper presents the Neutrosophic combinatorics by means of the combinations of the truth, the falsehood, and the indeterminacy in Smarandache’s Neutrosophy.
Fu, Anjie, Fu, Yuhua
core +1 more source
ICECA2023 - Yaakov Malinovsky - International Conference on Enumerative Combinatorics & Applications
, 2023 ICECA2023 , International Conference on Enumerative Combinatorics & Applications, September 4-6, 2023, Virtual, University of Haifa, Israelhttps://www.youtube.com/watch?v ...
Malinovsky, Yaakov, Alon, Noga
core +1 more source
International Journal of Mathematical Combinatorics, Vol.6 [PDF]
, 2012 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
General Randic matrix and general Randi'c energy [PDF]
Transactions on Combinatorics, 2014 Let $G$ be a simple graph with vertex set $V(G) = {v_1, v_2,ldots , v_n}$ and $d_i$ the degree of its vertex $v_i$, $i = 1, 2, cdots, n$. Inspired by the Randi'c matrix and the general Randi'c index of a graph, we introduce the concept of general ...
Ran Gu;, Fei Huang, Xueliang Li
doaj
Rainbow Vertex-Connection and Forbidden Subgraphs
Discussiones Mathematicae Graph Theory, 2018 A path in a vertex-colored graph is called vertex-rainbow if its internal vertices have pairwise distinct colors. A vertex-colored graph G is rainbow vertex-connected if for any two distinct vertices of G, there is a vertex-rainbow path connecting them ...
Li Wenjing, Li Xueliang, Zhang Jingshu
doaj +1 more source
On interval number in cycle convexity [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Recently, Araujo et al. [Manuscript in preparation, 2017] introduced the notion of Cycle Convexity of graphs. In their seminal work, they studied the graph convexity parameter called hull number for this new graph convexity they proposed, and they ...
Julio Araujo +3 more
doaj +1 more source
Odd Harmonious Labeling of Pn ⊵ C4 and Pn ⊵ D2(C4)
Indonesian Journal of Combinatorics, 2021 A graph G with q edges is said to be odd harmonious if there exists an injection f:V(G) → ℤ2q so that the induced function f*:E(G)→ {1,3,...,2q-1} defined by f*(uv)=f(u)+f(v) is a bijection.Here we show that graphs constructed by edge comb product of ...
Sabrina Shena Sarasvati +2 more
doaj +1 more source