Results 181 to 190 of about 1,278 (205)

On the Hardness of Switching to a Small Number of Edges

Journal of Graph Theory, EarlyView.
ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek, Eva Jelínková, Jan Kratochvíl   +2 more
wiley   +1 more source

Gauge fixing for sequence-function relationships. [PDF]

PLoS Comput Biol
Posfai A, Zhou J, McCandlish DM, Kinney JB.   +3 more
europepmc   +1 more source

Pipelined and conflict-free number theoretic transform accelerator for CRYSTALS-Kyber on FPGA. [PDF]

PLoS One
Waris A, Aziz A, Khan BM.
europepmc   +1 more source

RGB image encryption using SPN with a novel block cipher over simple graph adjacency matrices and Galois fields. [PDF]

Sci Rep
Sajjad M, Alqwaifly NA.
europepmc   +1 more source

Traffic flow prediction based on temporal attention and multi-graph adjacency fusion using DynamicChebNet. [PDF]

Sci Rep
Zhang J, Cheng J, Li F.
europepmc   +1 more source

Spectral quantum algorithm for passive scalar transport in shear flows. [PDF]

Sci Rep
Pfeffer P, Brearley P, Laizet S, Schumacher J.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Extended Forms of Certain Hybrid Special Polynomials Related to Appell Sequences

Bulletin of the Malaysian Mathematical Sciences Society, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ali, Mahvish, Khan, Subuhi
openaire   +1 more source

Fractional calculus and generalized forms of special polynomials associated with Appell sequences

Georgian Mathematical Journal, 2019
Abstract In this article, an operational definition, generating function, explicit summation formula, determinant definition and recurrence relations of the generalized families of Hermite–Appell polynomials are derived by using integral transforms and some known operational rules.
Khan, Subuhi, Wani, Shahid Ahmad
openaire   +1 more source

Combinatorial Property of a Special Polynomial Sequence

Canadian Mathematical Bulletin, 1977
Leeming [4] has defined a sequence of polynomials {Q4n(x)} and a sequence of integers {Q4n} by means of1and2Thus3Leeming showed that the Q4n are all odd and that4It is proved in [3 ...
openaire   +2 more sources