Results 251 to 260 of about 159,016,183 (278)
Some of the next articles are maybe not open access.

Related searches:

A note on 1-2-3 conjecture for Halin graphs

Discrete Mathematics, Algorithms and Applications, 2021
The well-known 1-2-3 Conjecture asserts the edges of every connected graph with at least three vertices can be weighted with 1, 2 and 3 so that adjacent vertices receive distinct sums of weights. In this paper, we show this conjecture holds for Halin graph. Moreover, this bound is tight.
Xiaoli Jiang, Zhengke Miao, Xiaowei Yu
openaire   +2 more sources

A Relaxed Case on 1-2-3 Conjecture

Graphs and Combinatorics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yuping Gao   +2 more
openaire   +3 more sources

Solving X23n+22n+2n−1+(X+1)23n+22n+2n−1=b in F24n and an alternative proof of a conjecture on the differential spectrum of the related monomial functions

Finite Fields and Their Applications, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kim, Kwang Ho, Mesnager, Sihem
openaire   +3 more sources

The 1‐2‐3‐conjecture holds for dense graphs

Journal of Graph Theory, 2018
AbstractThis paper confirms the 1‐2‐3‐conjecture for graphs that can be edge‐decomposed into cliques of order at least 3. Furthermore we combine this with a result by Barber, Kühn, Lo, and Osthus to show that there is a constants such that every graph with and , where is the minimum degree of satisfying the 1‐2‐3‐conjecture.
openaire   +2 more sources

Notes on Further Refining De Sitter Swampland Conjecture With Inflationary Models

Chinese Journal of Physics, 2022
Mohammad Reza Alipour   +2 more
exaly  

Scalar Weak Gravity Conjecture in Super Yang-Mills Inflationary Model

Universe, 2022
Mohammad Reza Alipour   +1 more
exaly  

Normal Scalar Curvature Conjecture and Its Applications

Journal of Functional Analysis, 2011
Zhiqin Lu
exaly  

Home - About - Disclaimer - Privacy