Results 31 to 40 of about 46,626 (239)
International Journal of Mathematical Combinatorics, Vol.5 [PDF]
, 2011 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
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
On the combinatorics of plethysm
Journal of Combinatorial Theory, Series A, 1987 The preceding review of A. Kerber comprises both articles, the one reviewed there and the present one, in a joint review. The reader is therefore kindly requested to read the preceding review.
Oscar, A., Nava, Z.
openaire +2 more sources
Combinatorics and topology of Kawai-Lewellen-Tye relations [PDF]
, 2017 A bstractWe revisit the relations between open and closed string scattering amplitudes discovered by Kawai, Lewellen, and Tye (KLT). We show that they emerge from the un-derlying algebro-topological identities known as the twisted period relations.
Sebastian Mizera
semanticscholar +1 more source
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
Combinatorics of Antiprism Triangulations [PDF]
Discrete & Computational Geometry, 2022 The antiprism triangulation provides a natural way to subdivide a simplicial complex $Δ$, similar to barycentric subdivision, which appeared independently in combinatorial algebraic topology and computer science. It can be defined as the simplicial complex of chains of multi-pointed faces of $Δ$, from a combinatorial point of view, and by successively ...
Christos A. Athanasiadis +2 more
openaire +3 more sources
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
Erdős-Gallai-Type Results for Total Monochromatic Connection of Graphs
Discussiones Mathematicae Graph Theory, 2019 A graph is said to be total-colored if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a total monochromatically-connecting coloring (TMC-coloring, for short) if any two vertices of the graph are connected by a ...
Jiang Hui, Li Xueliang, Zhang Yingying
doaj +1 more source