Results 1 to 10 of about 563,274 (244)
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Akbar Davoodi, Behnaz Omoomi
doaj +8 more sources
The 1-2-3 Conjecture for Hypergraphs [PDF]
Journal of Graph Theory, 2016 A weighting of the edges of a hypergraph is called vertex-coloring if the weighted degrees of the vertices yield a proper coloring of the graph, i.e., every edge contains at least two vertices with different weighted degrees.
Kalkowski, Maciej +2 more
core +4 more sources
On a Total Version of 1-2-3 Conjecture
Discussiones Mathematicae Graph Theory, 2020 A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set {1, . . . , k}. These colors can be used to distinguish adjacent vertices of G. There are many possibilities of such a distinction.
Baudon Olivier +5 more
doaj +3 more sources
On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 This paper is dedicated to studying the following question: Is it always possible to injectively assign the weights 1, ..., |E(G)| to the edges of any given graph G (with no component isomorphic to K2) so that every two adjacent vertices of G get ...
Julien Bensmail +2 more
doaj +5 more sources
Sequence variations of the 1-2-3 conjecture and irregularity strength [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Graph ...
Ben Seamone, Brett Stevens
doaj +3 more sources
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 How can one distinguish the adjacent vertices of a graph through an edge-weighting? In the last decades, this question has been attracting increasing attention, which resulted in the active field of distinguishing labellings.
Olivier Baudon +7 more
doaj +3 more sources
On the crossing numbers of join products of W_{4}+P_{n} and W_{4}+C_{n} [PDF]
Opuscula Mathematica, 2021 The crossing number \(\mathrm{cr}(G)\) of a graph \(G\) is the minimum number of edge crossings over all drawings of \(G\) in the plane. The main aim of the paper is to give the crossing number of the join product \(W_4+P_n\) and \(W_4+C_n\) for the ...
Michal Staš, Juraj Valiska
doaj +1 more source
A gravitino distance conjecture
Journal of High Energy Physics, 2021 We conjecture that in a consistent supergravity theory with non-vanishing gravitino mass, the limit m 3/2 → 0 is at infinite distance. In particular one can write M tower ~ m 3 / 2 δ $$ {m}_{3/2}^{\delta } $$ so that as the gravitino mass goes to zero, a
Alberto Castellano +3 more
doaj +1 more source
On locally irregular decompositions and the 1-2 Conjecture in digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 The 1-2 Conjecture raised by Przybylo and Wozniak in 2010 asserts that every undirected graph admits a 2-total-weighting such that the sums of weights "incident" to the vertices yield a proper vertex-colouring.
Olivier Baudon +3 more
doaj +1 more source
Sharpening the Distance Conjecture in diverse dimensions
Journal of High Energy Physics, 2022 The Distance Conjecture holds that any infinite-distance limit in the scalar field moduli space of a consistent theory of quantum gravity must be accompanied by a tower of light particles whose masses scale exponentially with proper field distance ‖ϕ‖ as
Muldrow Etheredge +4 more
doaj +1 more source