Results 131 to 140 of about 153,964 (249)

Covering Graphs with Few Complete Bipartite Subgraphs

Theoretical Computer Science, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fleischner, H., Mujuni, E., Paulusma, Daniel, Szeider, S.   +3 more
openaire   +2 more sources

Structural Characterization, β‐Cyclodextrin Polymer Interaction, and Biological Assessment of the N‐Terminal Peptide from the RPD‐1 Big Defensin of Ruditapes p hilippinarum

Chemistry–Methods, Volume 6, Issue 5, May 2026.
Defensins are a large and ancient family of host–defence peptides present across vertebrates, invertebrates, and plants, where they play a crucial role in innate immunity. Among them, big defensins represent a structurally distinctive subfamily characterized by a hydrophobic N‐terminal domain and a cysteine‐rich C‐terminal β‐defensin‐like domain. Here,
Rita Turnaturi, Giuseppa Augello, Giuseppe Nocito, Marcello Tagliavia, Stefania Zimbone, Rosalia Pellitteri, Giuseppina Sabatino, Giuseppe Di Natale, Michele F. M. Sciacca, Milo Malanga, Antonino Mazzaglia, Melchiorre Cervello, Giuseppe Pappalardo   +12 more
wiley   +1 more source

The scaling of seed‐dispersal specialization in interaction networks across levels of organization

Ecography, Volume 2026, Issue 5, May 2026.
Natural ecosystems are characterized by a specialization pattern where few species are common while many others are rare. In ecological networks involving biotic interactions, specialization operates as a continuum at individual, species, and community levels. Theory predicts that ecological and evolutionary factors can primarily explain specialization.
Gabriel M. Moulatlet, Pedro Luna, Wesley Dáttilo, Fabricio Villalobos   +3 more
wiley   +1 more source

Bipartite Digraphs with Modular Concept Lattices of height 2

Қарағанды университетінің хабаршысы. Математика сериясы
This paper investigates the interaction between Formal Concept Analysis (FCA) and graph theory, with a focus on understanding the structure and representation of concept lattices derived from bipartite directed graphs.
A.O. Basheyeva, A.T. Zhussupova, Y.K. Nurlibayev   +2 more
doaj   +1 more source

On bipartite graphs with complete bipartite star complements

Linear Algebra and its Applications, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Conkazal‐M1 from the MKAVA family of conotoxins: A dual‐function protease inhibitor and neuroactive peptide

Protein Science, Volume 35, Issue 5, May 2026.
Abstract Marine cone snails produce a diverse array of bioactive peptides, known as conotoxins, in their venom. Given their high target potency and specificity, conotoxins are attractive compounds for the development of precision research tools and pharmacological agents.
Celeste M. Hackney, Thomas Lund Koch, Nicklas Lund Ryding, Aymeric Rogalski, Kevin Chase, Matías Leonel Giglio, Samuel S. Espino, Zildjian G. Acyatan, Maren Watkins, Baldomero M. Olivera, Helena Safavi‐Hemami, Kaare Teilum, Lars Ellgaard   +12 more
wiley   +1 more source

Polymatroidal tilings and the Chow class of linked projective spaces

Bulletin of the London Mathematical Society, Volume 58, Issue 5, May 2026.
Abstract Linked projective spaces are quiver Grassmannians of constant dimension one of certain quiver representations, called linked nets, over certain quivers, called Zn$\mathbb {Z}^n$‐quivers. They were recently introduced as a tool for describing schematic limits of families of divisors.
Felipe de Leon, Eduardo Esteves
wiley   +1 more source

Impact of Self-Loops on the Determinant of Graphs

Journal of Mathematics
The current theoretical study intends to analyze the determinant of a certain class of graphs with self-loops. This study focuses on a vast unexplored area of adjacency matrices with nonzero diagonal entities.
Deekshitha V. A., Gowtham H. J., Sabitha D., Girija K. P.   +3 more
doaj   +1 more source

Topological Ramsey Theorem for Complete Bipartite Graphs

Journal of Combinatorial Theory, Series B, 1994
An embedding of a graph into a space is linear if each edge is a straight line segment. In 1991, \textit{S. Negami} [Trans. Am. Math. Soc. 324, No. 2, 527-541 (1991; Zbl 0721.57004)] showed that for any given knot, link, or spatial graph there is a sufficiently large complete graph \(K_ n\) such that every linear embedding of \(K_ n\) into a space ...
openaire   +1 more source

Partitioning Complete Bipartite Graphs by Monochromatic Cycles

Journal of Combinatorial Theory, Series B, 1997
For every positive integer \(r\) there exists a constant \(C_r\) depending only on \(r\) such that for every colouring of the edges of the complete bipartite graph \(K^{n,n}\) with \(r\) colours, there exists a set of at most \(C_r\) monochromatic cycles whose vertex sets partition the vertex set of \(K^{n,n}\).
openaire   +1 more source