Results 51 to 60 of about 2,991,925 (319)
On the Distance Spectral Radius of Trees with Given Degree Sequence
Discussiones Mathematicae Graph Theory, 2020 We consider the problem of maximizing the distance spectral radius and a slight generalization thereof among all trees with some prescribed degree sequence.
Dadedzi Kenneth +2 more
doaj +1 more source
A Degree Sequence Komlós Theorem [PDF]
SIAM Journal on Discrete Mathematics, 2019 20 pages, 4 figures. Author accepted manuscript.
Joseph Hyde, Hong Liu, Andrew Treglown
openaire +2 more sources
Reduced criteria for degree sequences [PDF]
Discrete Mathematics, 2013 For many types of graphs, criteria have been discovered that give necessary and sufficient conditions for an integer sequence to be the degree sequence of such a graph. These criteria tend to take the form of a set of inequalities, and in the case of the Erd s-Gallai criterion (for simple undirected graphs) and the Gale-Ryser criterion (for bipartite ...
openaire +2 more sources
On the Degree Sequences of Uniform Hypergraphs [PDF]
, 2013 In hypergraph theory, determining a good characterization of d, the degree sequence of an h-uniform hypergraph $\mathcal{H}$, and deciding the complexity status of the reconstruction of $\mathcal{H}$ from d, are two challenging open problems. They can be formulated in the context of discrete tomography: asks whether there is a matrix A with nonnegative
FROSINI, ANDREA +2 more
openaire +3 more sources
How likely is an i.i.d. degree sequence to be graphical?
, 2005 Given i.i.d. positive integer valued random variables D_1,...,D_n, one can ask whether there is a simple graph on n vertices so that the degrees of the vertices are D_1,...,D_n. We give sufficient conditions on the distribution of D_i for the probability
No. B +2 more
core +3 more sources
Component Order Edge Connectivity, Vertex Degrees, and Integer Partitions
Theory and Applications of GraphsGiven a finite, simple graph G, the k-component order connectivity (resp. edge connectivity) of G is the minimum number of vertices (resp. edges) whose removal results in a subgraph in which every component has an order of at most k − 1.
Michael R. Yatauro
doaj +1 more source
Degree Sequence Index Strategy [PDF]
, 2012 We introduce a procedure, called the Degree Sequence Index Strategy (DSI), by which to bound graph invariants by certain indices in the ordered degree sequence.
Caro, Yair, Pepper, Ryan
core
A novel configuration model for random graphs with given degree sequence
, 2007 Recently, random graphs in which vertices are characterized by hidden variables controlling the establishment of edges between pairs of vertices have attracted much attention. Here, we present a specific realization of a class of random network models in
Bekessy A +10 more
core +1 more source
Population Ecology, EarlyView.Population size and dynamics fundamentally shape speciation by influencing genetic drift, founder events, and adaptive potential. Small populations may speciate rapidly due to stronger drift, whereas large populations harbor more genetic diversity, which can alter divergence trajectories. We highlight theoretical models that incorporate population size
Ryo Yamaguchi +3 more
wiley +1 more source
Evolutionary interplay between viruses and R‐loops
FEBS Letters, EarlyView.Viruses interact with specialized nucleic acid structures called R‐loops to influence host transcription, epigenetic states, latency, and immune evasion. This Perspective examines the roles of R‐loops in viral replication, integration, and silencing, and how viruses co‐opt or avoid these structures.
Zsolt Karányi +4 more
wiley +1 more source