Results 21 to 30 of about 12,930 (215)

A subexponential-time, polynomial quantum space algorithm for inverting the CM group action

Journal of Mathematical Cryptology, 2020
We present a quantum algorithm which computes group action inverses of the complex multiplication group action on isogenous ordinary elliptic curves, using subexponential time, but only polynomial quantum space.
Jao David, LeGrow Jason, Leonardi Christopher, Ruiz-Lopez Luis   +3 more
doaj   +1 more source

Polynomial reconstruction of the matching polynomial

Electronic Journal of Graph Theory and Applications, 2015
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values for the vertex ...
Xueliang Li, Yongtang Shi, Martin Trinks
doaj   +1 more source

Rational combinatorics

Advances in Applied Mathematics, 2008
We propose a categorical setting for the study of the combinatorics of rational numbers. We find combinatorial interpretation for the Bernoulli and Euler numbers and polynomials.
Blandín, Héctor, Díaz, Rafael
openaire   +2 more sources

From light edges to strong edge-colouring of 1-planar graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2020
A strong edge-colouring of an undirected graph $G$ is an edge-colouring where every two edges at distance at most~$2$ receive distinct colours. The strong chromatic index of $G$ is the least number of colours in a strong edge-colouring of $G$.
Julien Bensmail, François Dross, Hervé Hocquard, Eric Sopena   +3 more
doaj   +1 more source

Combinatorics

, 2020
Alexander G. Alenitsyn, Eugene I. Butikov, Alexander S. Kondratyev   +2 more
  +4 more sources

INTEGRABLE COMBINATORICS [PDF]

Proceedings of the International Congress of Mathematicians (ICM 2018), 2013
We review various combinatorial problems with underlying classical or quantum integrable structures. (Plenary talk given at the International Congress of Mathematical Physics, Aalborg, Denmark, August 10, 2012.)
openaire   +4 more sources

Combinatorial optimization in networks with Shared Risk Link Groups [PDF]

Discrete Mathematics & Theoretical Computer Science, 2016
The notion of Shared Risk Link Groups (SRLG) captures survivability issues when a set of links of a network may fail simultaneously. The theory of survivable network design relies on basic combinatorial objects that are rather easy to compute in the ...
David Coudert, Stéphane Pérennes, Hervé Rivano, Marie-Emilie Voge   +3 more
doaj   +1 more source

On Proper (Strong) Rainbow Connection of Graphs

Discussiones Mathematicae Graph Theory, 2021
A path in an edge-colored graph G is called a rainbow path if no two edges on the path have the same color. The graph G is called rainbow connected if between every pair of distinct vertices of G, there is a rainbow path.
Jiang Hui, Li Wenjing, Li Xueliang, Magnant Colton   +3 more
doaj   +1 more source

Odd Harmonious Labeling of P_n ⊵ C₄ and  P_n ⊵ D₂(C₄)

Indonesian Journal of Combinatorics, 2021
A graph G with q edges is said to be odd harmonious if there exists an injection f:V(G) → ℤ2q so that the induced function f*:E(G)→ {1,3,...,2q-1} defined by f*(uv)=f(u)+f(v) is a bijection.Here we show that graphs constructed by edge comb product of ...
Sabrina Shena Sarasvati, Ikhsanul Halikin, Kristiana Wijaya   +2 more
doaj   +1 more source

Skew Randi'c matrix and skew Randi'c energy [PDF]

Transactions on Combinatorics, 2016
Let $G$ be a simple graph with an orientation $sigma$‎, ‎which ‎assigns to each edge a direction so that $G^sigma$ becomes a‎ ‎directed graph‎. ‎$G$ is said to be the underlying graph of the‎ ‎directed graph $G^sigma$‎.
Ran Gu, Fei Huang, Xueliang Li
doaj