Results 41 to 50 of about 982,672 (306)
Designs of Branch-Line Couplers by Considering the Parasitic Effects of P-I-N Diodes
IEEE Access, 2020 Branch-line couplers (BLCs) are commonly used in the wireless systems. To achieve reconfigurable applications, switchable BLCs with p-i-n diodes can be used.
Pu-Hua Deng +6 more
doaj +1 more source
Dyck tilings, linear extensions, descents, and inversions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Dyck tilings were introduced by Kenyon and Wilson in their study of double-dimer pairings. They are certain kinds of tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths.
Jang Soo Kim +3 more
doaj +1 more source
Discrete Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James Haglund, Jeffrey B. Remmel
openaire +2 more sources
PERFECT MATCHING IN COMPLETE INTUITIONISTIC FUZZY GRAPHS [PDF]
, 2022 A induced sub graph ? H ? of a intuitionistic fuzzy graph G(V,E) is said to be a matching if every vertex of G(V,E)is incident with at most a vertex in ? H ? .A induced fuzzy sub graph ? H ?
Mahadevaswamy B. S.
core
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
FEBS Open Bio, EarlyView.We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source
A Maximum Resonant Set of Polyomino Graphs
Discussiones Mathematicae Graph Theory, 2016 A polyomino graph P is a connected finite subgraph of the infinite plane grid such that each finite face is surrounded by a regular square of side length one and each edge belongs to at least one square.
Zhang Heping, Zhou Xiangqian
doaj +1 more source
Perfect matchings and perfect squares
Journal of Combinatorial Theory, Series A, 1994 The author investigates (perfect) matchings of a large class of graphs with 4-fold rotational symmetry. It is proved by mostly combinatorial arguments that the number of such matchings is always a square or double a square. This result has an interesting application to tilings by dominoes.
openaire +4 more sources
Small RNA pathways in mammalian oocytes
FEBS Open Bio, EarlyView.Three distinct small RNA pathways operate in mammalian oocytes: RNAi interference (RNAi), the microRNA (miRNA) pathway, and the PIWI‐associated RNA (piRNA) pathway. These pathways use small RNAs to guide sequence‐specific repression and contribute to oocyte biology by targeting genes and mobile elements or appear insignificant since different ...
Petr Svoboda, Josef Pasulka
wiley +1 more source
Strongly (k, d)-Graphical Labellings For Designing Graphical Passwords In Communication
MATEC Web of Conferences, 2017 The safety of the traditional text passwords is questioned by many users in the present information research. Graphical passwords become new research object of many researchers, who hope they can replace the existing text passwords and improve user ...
Sun Hui, Zhang Xiaohui, Yao Bing
doaj +1 more source
The cost of perfection for matchings in graphs
Discrete Applied Mathematics, 2016 Perfect matchings and maximum weight matchings are two fundamental combinatorial structures. We consider the ratio between the maximum weight of a perfect matching and the maximum weight of a general matching. Motivated by the computer graphics application in triangle meshes, where we seek to convert a triangulation into a quadrangulation by merging ...
Emilio Vital Brazil +3 more
openaire +3 more sources