Results 81 to 90 of about 1,707 (110)

Anti‐magic graphs via the Combinatorial NullStellenSatz

Journal of Graph Theory, 2005
AbstractAn antimagic labeling of a graph with m edges and n vertices is a bijection from the set of edges to the integers 1,…,m such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with that vertex. A graph is called antimagic if it has an antimagic labeling.
openaire   +2 more sources

Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited

Journal of Graph Theory, 2014
AbstractConsider a simple graph and its proper edge coloring c with the elements of the set . We say that c is neighbor set distinguishing (or adjacent strong) if for every edge , the set of colors incident with u is distinct from the set of colors incident with v.
Przybyło, Jakub, Wong, Tsai-Lien
openaire   +2 more sources

Tropical Combinatorial Nullstellensatz and Fewnomials Testing

2017
Tropical algebra emerges in many fields of mathematics such as algebraic geometry, mathematical physics and combinatorial optimization. In part, its importance is related to the fact that it makes various parameters of mathematical objects computationally accessible.
Dima Grigoriev, Vladimir V. Podolskii
openaire   +1 more source

Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz

Graphs and Combinatorics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ding, Laihao, Wang, Guanghui, Wu, Jianliang, Yu, Jiguo   +3 more
openaire   +2 more sources

An application of the combinatorial Nullstellensatz to a graph labelling problem

Journal of Graph Theory, 2010
AbstractAn antimagic labelling of a graph G with m edges and n vertices is a bijection from the set of edges of G to the set of integers {1,…,m}, such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with that vertex. A graph is called antimagic if it admits an antimagic labelling.
Hefetz, Dan, Saluz, Annina, Tran, Huong T. T.   +2 more
openaire   +2 more sources

Combinatorial Nullstellensatz

2021
Xuding Zhu, R. Balakrishnan
openaire   +2 more sources

Neighbor distinguishing total choice number of sparse graphs via the Combinatorial Nullstellensatz

Acta Mathematicae Applicatae Sinica, English Series, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qu, Cun-quan, Ding, Lai-hao, Wang, Guang-hui, Yan, Gui-ying   +3 more
openaire   +2 more sources

Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz

SIAM Journal on Discrete Mathematics, 2013
Consider a simple graph $G=(V,E)$ and its proper edge coloring $c$ with the elements of the set $\{1,2,\ldots,k\}$ (or any other $k$-element set of real numbers). We say that $c$ is neighbor sum distinguishing if $\sum_{w\in N_G(v)}c(wv)\neq \sum_{w\in N_G(u)}c(wu)$ for every edge $uv\in E$.
openaire   +1 more source

Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz

Acta Mathematicae Applicatae Sinica, English Series, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu, Xiao-wei, Gao, Yu-ping, Ding, Lai-hao   +2 more
openaire   +2 more sources

Integrative oncology: Addressing the global challenges of cancer prevention and treatment

Ca-A Cancer Journal for Clinicians, 2022
Jun J Mao,, Msce, Lorenzo Cohen, Karen M Mustian   +2 more
exaly