Results 321 to 330 of about 9,193,291 (353)

Degree sequence of the generalized Sierpiński graph

Contributions Discret. Math., 2019
Sierpiński graphs are studied in fractal theory and have applications in diverse areas including dynamic systems, chemistry, psychology, probability, and computer science.
A. Behtoei, M. Khatibi, F. Attarzadeh
semanticscholar   +1 more source

Speeding up Switch Markov Chains for Sampling Bipartite Graphs with Given Degree Sequence

International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2018
textabstractWe consider the well-studied problem of uniformly sampling (bipartite) graphs with a given degree sequence, or equivalently, the uniform sampling of binary matrices with fixed row and column sums. In particular, we focus on Markov Chain Monte
C. J. Carstens, P. Kleer
semanticscholar   +1 more source

Degree Sequence Bounds

ACM Transactions on Database Systems
Recent work has demonstrated the catastrophic effects of poor cardinality estimates on query processing time. In particular, underestimating query cardinality can result in overly optimistic query plans which take orders of magnitude longer to complete ...
Kyle Deeds, Dan Suciu, Magdalena Balazinska, Walter Cai   +3 more
semanticscholar   +1 more source

Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem

SIAM Journal on Discrete Mathematics, 2015
A sequence $\pi=(d_1,\ldots,d_n)$ is graphic if there is a simple graph $G$ with vertex set $\{v_1,\ldots,v_n\}$ such that the degree of $v_i$ is $d_i$. We say that graphic sequences $\pi_1=(d_1^{(1)},\ldots,d_n^{(1)})$ and $\pi_2=(d_1^{(2)},\ldots,d_n^{(
Jennifer Diemunsch, M. Ferrara, S. Jahanbekam, James M. Shook   +3 more
semanticscholar   +1 more source

Adjacency Relationships Forced by a Degree Sequence

Graphs and Combinatorics, 2015
There are typically several nonisomorphic graphs having a given degree sequence, and for any two degree sequence terms it is often possible to find a realization in which the corresponding vertices are adjacent and one in which they are not.
Michael D. Barrus
semanticscholar   +1 more source

Spectral radius and Average 2-Degree sequence of a Graph

Discret. Math. Algorithms Appl., 2014
In a simple connected graph, the average 2-degree of a vertex is the average degree of its neighbors. With the average 2-degree sequence and the maximum degree ratio of adjacent vertices, we present a sharp upper bound of the spectral radius of the ...
Yu-pei Huang, Chih-wen Weng
semanticscholar   +1 more source

Descending sequences of degrees

Journal of Symbolic Logic, 1975
Our unexplained notation is that of Rogers [4]. Let P ⊆ 2N × 2N. We call a sequence <An: n ∈ N> of subsets of N a P-sequence iff ∀n(An+1 = the unique B such that P(An, B)).Theorem. Let P ⊆ 2N × 2N be arithmetical. Then there is no P-sequence <An: n ∈ N> such that ∀n(A′n+1 ≤T An).This theorem improves a result of Friedman [2] who showed that
openaire   +2 more sources

The Aα-spectral radius of trees and unicyclic graphs with given degree sequence

Applied Mathematics and Computation, 2019
Dan Li, Yuanyuan Chen, J. Meng
semanticscholar   +1 more source

Planning for post‐pandemic cancer care delivery: Recovery or opportunity for redesign?

Ca-A Cancer Journal for Clinicians, 2021
Pelin Cinar, Daniela A Bota, Kathryn A Gold   +2 more
exaly  

The Minimal Number of Subtrees with a Given Degree Sequence

Graphs Comb., 2015
Xiu-Mei Zhang, Xiaodong Zhang
semanticscholar   +1 more source