Results 71 to 80 of about 9,193,291 (353)
Discussiones Mathematicae Graph Theory, 2020 Let S = (a1,. . . , am; b1, . . . , bn), where a1, . . . , am and b1, . . . , bn are two sequences of nonnegative integers. We say that S is a bigraphic pair if there exists a simple bipartite graph G with partite sets {x1, x2, . . . , xm} and {y1, y2, .
Yin Jian-Hua, Li Sha-Sha
doaj +1 more source
Degree sequences of matrogenic graphs
Discrete Mathematics, 1984 AbstractA structural description and a recognition algorithm for matrogenic graphs [4] are given. In fact, matrogenicity is seen to depend only on the degree sequence. An explicit characterization of the degree sequences of matrogenic graphs, and more generally of box-threshold graphs [10], is provided.
MARCHIORO P. +3 more
openaire +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
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
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
Percolation on sparse random graphs with given degree sequence
, 2007 We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards we focus on ...
Fountoulakis, Nikolaos
core +2 more sources
Efficient counting of degree sequences [PDF]
Discrete Mathematics, 2019 Novel dynamic programming algorithms to count the set $D(n)$ of zero-free degree sequences of length $n$, the set $D_c(n)$ of degree sequences of connected graphs on $n$ vertices and the set $D_b(n)$ of degree sequences of biconnected graphs on $n$ vertices exactly are presented.
openaire +3 more sources
The unpredictably eruptive dynamics of spruce budworm populations in eastern Canada
Population Ecology, EarlyView.We examine historical population data for spruce budworm from several locations through the period 1930–1997, and use density‐dependent recruitment curves to test whether the pattern of population growth over time is more consistent with Royama's (1984; Ecological Monographs 54:429–462) linear R(t) model of harmonic oscillation at Green River New ...
Barry J. Cooke, Jacques Régnière
wiley +1 more source
Computing the sum of k largest Laplacian eigenvalues of tricyclic graphs [PDF]
Discrete Mathematics Letters, 2022 Pawan Kumar +2 more
doaj +1 more source
New Bounds For Degree Sequence Of Graphs [PDF]
Computer Science Journal of Moldova, 2019 Let $G = (V, E)$ be a simple graph with $n$ vertices, $m$ edges, and vertex degrees $d_1, d_2, ..., d_n$. Let $d_1, d_n$ be the maximum and and minimum degree of vertices. In this paper, we present lower and upper bounds for $\sum_{i=1}^{n}d_i^{2}$ and
Akbar Jahanbani
doaj