Results 41 to 50 of about 159,016,183 (278)
Reduced Collatz Dynamics Data Reveals Properties for the Future Proof of Collatz Conjecture
Data, 2019 Collatz conjecture is also known as 3X + 1 conjecture. For verifying the conjecture, we designed an algorithm that can output reduced dynamics (occurred 3 × x + 1 or x/2 computations from a starting integer to the first integer smaller than the ...
Wei Ren
doaj +1 more source
1-2-3 Conjecture in digraphs: More results and directions
Discrete Applied Mathematics, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bensmail, Julien, Lyngsie, Kasper
openaire +5 more sources
Pushing Vertices to Make Graphs Irregular [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn connection with the so-called 1-2-3 Conjecture, we introduce and study a new problem related to proper labellings. In the regular problem, proper labellings of graphs are designed by assigning strictly positive labels to the edges so that any two ...
Julien Bensmail +2 more
doaj +1 more source
Facial rainbow edge-coloring of simple 3-connected plane graphs [PDF]
Opuscula Mathematica, 2020 A facial rainbow edge-coloring of a plane graph \(G\) is an edge-coloring such that any two edges receive distinct colors if they lie on a common facial path of \(G\).
Július Czap
doaj +1 more source
(Quasi-) de Sitter solutions across dimensions and the TCC bound
Journal of High Energy Physics, 2023 In this work, we investigate the existence of string theory solutions with a d-dimensional (quasi-) de Sitter spacetime, for 3 ≤ d ≤ 10. Considering classical compactifications, we derive no-go theorems valid for general d. We use them to exclude (quasi-)
David Andriot, Ludwig Horer
doaj +1 more source
Upper bounds for inverse domination in graphs
Theory and Applications of Graphs, 2021 In any graph $G$, the domination number $\gamma(G)$ is at most the independence number $\alpha(G)$. The \emph{Inverse Domination Conjecture} says that, in any isolate-free $G$, there exists pair of vertex-disjoint dominating sets $D, D'$ with $|D|=\gamma(
Elliot Krop +2 more
doaj +1 more source
$p$-groups with maximal elementary abelian subgroups of rank $2$ [PDF]
, 2010 Let p be an odd prime number and G a finite p-group. We prove that if the rank of G is greater than p, then G has no maximal elementary abelian subgroup of rank 2.
Mazza, Nadia, Glauberman, George
core +5 more sources
Core Index of Perfect Matching Polytope for a 2-Connected Cubic Graph
Discussiones Mathematicae Graph Theory, 2018 For a 2-connected cubic graph G, the perfect matching polytope P(G) of G contains a special point xc=(13,13,…,13)$x^c = \left( {{1 \over 3},{1 \over 3}, \ldots ,{1 \over 3}} \right)$ . The core index ϕ(P(G)) of the polytope P(G) is the minimum number of
Wang Xiumei, Lin Yixun
doaj +1 more source
A note on a directed version of the 1-2-3 Conjecture
Discrete Applied Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mirko Hornák +2 more
openaire +2 more sources
Weak and Strong Versions of the 1-2-3 Conjecture for Uniform Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2016 Given an $r$-uniform hypergraph $H=(V,E)$ and a weight function $\omega:E\to\{1,\dots,w\}$, a coloring of vertices of~$H$, induced by~$\omega$, is defined by $c(v) = \sum_{e\ni v} w(e)$ for all $v\in V$. If there exists such a coloring that is strong (that means in each edge no color appears more than once), then we say that $H$ is strongly $w ...
Patrick Bennett +3 more
openaire +4 more sources