Results 21 to 30 of about 3,067,250 (321)
Spectral ordering and 2-switch transformations [PDF]
The American Journal of Combinatorics, 2022 We address the problem of ordering trees with the same degree sequence by their spectral radii. To achieve that, we consider 2-switch transformations which preserve the degree sequence and establish when the index decreases.
Elismar Oliveira +2 more
doaj +3 more sources
On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Assume that $n, \delta ,k$ are integers with $0 \leq k < \delta < n$. Given a graph $G=(V,E)$ with $|V|=n$. The symbol $G-F, F \subseteq V$, denotes the graph with $V(G-F)=V-F$, and $E(G-F)$ obtained by $E$ after deleting the edges with at least one ...
Shih-Yan Chen, Shin-Shin Kao, Hsun Su
doaj +1 more source
A General Computational Approach for Counting Labeled Graphs
Algorithms, 2022 This paper presents a general recursive formula to estimate the number of labeled graphs as well as details to evaluate the formula for the following graph properties: number of edges (graph density), degree sequence, degree distribution, classification ...
Ravi Goyal, Victor De Gruttola
doaj +1 more source
Symmetric bipartite graphs and graphs with loops [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Grant Cairns, Stacey Mendan
doaj +1 more source
Enumeration of graphs with a heavy-tailed degree sequence [PDF]
, 2016 In this paper, we asymptotically enumerate graphs with a given degree sequence d=(d_1,...,d_n) satisfying restrictions designed to permit heavy-tailed sequences in the sparse case (i.e. where the average degree is rather small).
Gao, Pu, Wormald, Nicholas
core +1 more source
On the Grone-Merris conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Grone and Merris [GM94] conjectured that the Laplacian spectrum of a graph is majorized by its conjugate vertex degree sequence. We prove that this conjecture holds for a class of graphs including trees.
Tamon Stephen
doaj +1 more source
Degree Sequences of Infinite Graphs [PDF]
Journal of the London Mathematical Society, 1981 Peer Reviewed ; http://deepblue.lib.umich.edu/bitstream/2027.42/135582/1/jlms0010 ...
Blass, Andreas, Harary, Frank
openaire +2 more sources
On the necessity of Chvátal’s Hamiltonian degree condition
AKCE International Journal of Graphs and Combinatorics, 2020 In 1972 Chvátal gave a well-known sufficient condition for a graphical sequence to be forcibly Hamiltonian, and showed that in some sense his condition is best possible.
Douglas Bauer +3 more
doaj +1 more source
An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences
Theory and Applications of Graphs, 2021 As a partial answer to a question of Rao, a deterministic and customizable efficient algorithm is presented to test whether an arbitrary graphical degree sequence has a bipartite realization.
Kai Wang
doaj +1 more source
, 2014 Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs.
Deák, Attila
core +4 more sources