Results 121 to 130 of about 143,400 (232)
Covering Graphs with Few Complete Bipartite Subgraphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fleischner, H. +3 more
openaire +2 more sources
Another Proof of the Generalized Tutte—Berge Formula for f‐Bounded Subgraphs
ABSTRACT Given a nonnegative integer weight f ( v ) for each vertex v in a multigraph G, an f‐bounded subgraph of G is a multigraph H contained in G such that d H ( v ) ≤ f ( v ) for all v ∈ V ( G ). Using Tutte's f‐Factor Theorem, we give a new proof of the min–max relation for the maximum size of an f‐bounded subgraph of G. When f ( v ) = 1 for all v,
Zishen Qu, Douglas B. West
wiley +1 more source
ABSTRACT The analysis of certain properties of the underlying graph of a public transport network generates insights about the network's structure. Hereby, the choice of the graph representation depends on a trade‐off between complexity reduction and information preservation to adequately model a public transport network.
Michael Palk +2 more
wiley +1 more source
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 +12 more
wiley +1 more source
Decomposition of Certain Complete Bipartite Graphs into Prisms
Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n.
Froncek Dalibor
doaj +1 more source
Exploration of regularities in bipartite graphs using GEOGEBRA software
A classroom proposal is presented to integrate contents of Graph Theory and Linear Algebra in complete bipartite graphs, linking adjacency and Laplacian matrices, the eigenvalues of graphs will be determined, applicable to connectivity concepts. Students
E. Oliva, Mathias Díaz
semanticscholar +1 more source
The scaling of seed‐dispersal specialization in interaction networks across levels of organization
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 +3 more
wiley +1 more source
Signed total double Roman dominating functions in graphs
A signed total double Roman dominating function (STDRDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex v with [Formula: see text] has at least two neighbors assigned 2 under f or one neighbor w
L. Shahbazi +2 more
doaj +1 more source
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 +12 more
wiley +1 more source
Polymatroidal tilings and the Chow class of linked projective spaces
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

