Results 1 to 10 of about 111,857 (228)
On k-complementing permutations of cyclically k-complementary graphs [PDF]
Discrete Mathematics, 1996 Let \(K_n\) be a complete graph and \(H_1,H_2,\dots,H_k\) its isomorphic factorization where \(k>1\) and \(k\) divides \({1\over 2n} (n-1)\). Let \(\beta\) be a permutation on \(V(K_n)\) such that (by a suitable rearrangement of \(H_i\)) \(\beta: V(H_i)\to V(H_{i+1})\) is an isomorphism for \(i=1,2,\dots,k-1\). Then any isomorphical image of a factor \(
Bernaldez, Jose M.
exaly +5 more sources
Including the Magnitude Variability of a Signal in the Ordinal Pattern Analysis [PDF]
EntropyOne of the most popular and innovative methods to analyse signals is by using Ordinal Patterns (OPs). The OP encoding is based on transforming a (univariate) signal into a symbolic sequence of OPs, where each OP represents the number of permutations ...
Melvyn Tyloo +2 more
doaj +2 more sources
Self-complementary hypergraphs and their self-complementing permutations
Electronic Notes in Discrete Mathematics, 2006 Abstract A k –uniform hypergraph H = ( V ; E ) is called self-complementary if there is a permutation σ : V → V , called self-complementing , such that for every k –subset e of V , e ∈ E if and only if σ ( e ) ∉ E . In other words, H is isomorphic with H ′ = ( V ; ( V k ) −
Artur Szymanski, A. Pawel Wojda
exaly +3 more sources
Self-complementing permutations of k-uniform hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Graphs and Algorithms A k-uniform hypergraph H = ( V; E) is said to be self-complementary whenever it is isomorphic with its complement (H) over bar = ( V; ((V)(k)) - E). Every permutation sigma of the set V such that sigma(e) is an edge of (H) over bar if and only if e is an element of E is called self-complementing.
Artur Szymański, Adam Pawel Wojda
openaire +6 more sources
Circularly permuted variants of two CG-specific prokaryotic DNA methyltransferases. [PDF]
PLoS ONE, 2018 The highly similar prokaryotic DNA (cytosine-5) methyltransferases (C5-MTases) M.MpeI and M.SssI share the specificity of eukaryotic C5-MTases (5'-CG), and can be useful research tools in the study of eukaryotic DNA methylation and epigenetic regulation.
Pál Albert +3 more
doaj +1 more source
Cyclic Partitions of Complete and Almost Complete Uniform Hypergraphs
Discussiones Mathematicae Graph Theory, 2022 We consider cyclic partitions of the complete k-uniform hypergraph on a finite set V, minus a set of s edges, s ≥ 0. An s-almost t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permutation ...
Dilbarjot, Gosselin Shonda Dueck
doaj +1 more source
-partite self-complementary and almost self-complementary -uniform hypergraphs
AKCE International Journal of Graphs and Combinatorics, 2020 A hypergraph is said to be -partite -uniform if its vertex set can be partitioned into non-empty sets so that every edge in the edge set , consists of precisely one vertex from each set , . It is denoted as or if for .
L.N. Kamble +2 more
doaj +1 more source
Permutations avoiding the complement of a regular permutation group
Discrete Mathematics Letters, 2023 Summary: The class of permutations avoiding the complement of an arbitrary regular permutation group is described.
openaire +3 more sources
Brain Informatics, 2023 Mental wellbeing of university students is a growing concern that has been worsening during the COVID-19 pandemic. Numerous studies have gathered empirical data to explore the mental health impact of the pandemic on university students and investigate ...
Tianhua Chen
doaj +1 more source
Complementation and Reconstitution of Fluorescence from Circularly Permuted and Truncated Green Fluorescent Protein [PDF]
Biochemistry, 2009 Green fluorescent protein (GFP) has been used as a proof of concept for a novel "leave-one-out" biosensor design in which a protein that has a segment omitted from the middle of the sequence by circular permutation and truncation binds the missing peptide and reconstitutes its function.
Yao-ming, Huang, Christopher, Bystroff
openaire +2 more sources