Results 21 to 30 of about 147,491 (227)
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
Open questions about Ramsey-type statements in reverse mathematics [PDF]
, 2015 Ramsey's theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set H such that all n-element subsets of H have the same color.
Patey, Ludovic
core +3 more sources
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
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
Backbone colouring and algorithms for TDMA scheduling [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 We investigate graph colouring models for the purpose of optimizing TDMA link scheduling in Wireless Networks. Inspired by the BPRN-colouring model recently introduced by Rocha and Sasaki, we introduce a new colouring model, namely the BMRN-colouring ...
Julien Bensmail +4 more
doaj +1 more source
The 3-Rainbow Index of a Graph
Discussiones Mathematicae Graph Theory, 2015 Let G be a nontrivial connected graph with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ ℕ, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color.
Chen Lily +3 more
doaj +1 more source
Senior High School Students’ Higher Order Thinking Skills in Solving Combinatorics Problems
Jurnal Pendidikan Matematika, 2021 Higher Order Thinking Skills (HOTS) refer to students' ability to solve problems by analyzing, evaluating, and creating. HOTS are essential for 21st century learning. Solving combinatorics problem troubleshooting requires HOTS.
Arif Fatahillah +2 more
doaj +1 more source
Kaleidoscopic Edge-Coloring of Complete Graphs and r-Regular Graphs
Discussiones Mathematicae Graph Theory, 2019 For an r-regular graph G, we define an edge-coloring c with colors from {1, 2, . . . , k}, in such a way that any vertex of G is incident with at least one edge of each color. The multiset-color cm(v) of a vertex v is defined as the ordered tuple (a1, a2,
Li Xueliang, Zhu Xiaoyu
doaj +1 more source
Constructing elliptic curve isogenies in quantum subexponential time
Journal of Mathematical Cryptology, 2014 Given two ordinary elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit a nonzero isogeny between them, but finding such an isogeny is believed to be computationally difficult.
Childs Andrew +2 more
doaj +1 more source