Results 41 to 50 of about 5,011,430 (289)
Extremal trees with fixed degree sequence
, 2021 The greedy tree G(D) and the M-tree M(D) are known to be extremal among trees with degree sequence D with respect to various graph invariants. This paper provides a general theorem that covers a large family of invariants for which G(D) or M(D) is ...
Andriantiana, Eric O. D., +5 more
core +1 more source
Bipartite Digraphical Degree Sequence Problem [PDF]
, 1996 application/pdf論文(Article)A sequence of nonnegative integers S= (s₁, s₂, · · · ·, sn) is graphical if there is a graph with vertices v₁, V₂, · · · ·, Vn such that deg(vj) = si for each j = 1, 2, · · · ·, n. The graphical degree sequence problem is: Given
3291, TAKAHASHI, Masaya
core +1 more source
A Constructive Extension of the Characterization on Potentially Ks,t-Bigraphic Pairs
Discussiones Mathematicae Graph Theory, 2017 Let Ks,t be the complete bipartite graph with partite sets of size s and t. Let L1 = ([a1, b1], . . . , [am, bm]) and L2 = ([c1, d1], . . . , [cn, dn]) be two sequences of intervals consisting of nonnegative integers with a1 ≥ a2 ≥ . . . ≥ am and c1 ≥ c2
Guo Ji-Yun, Yin Jian-Hua
doaj +1 more source
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
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 balanced bipartitions of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Bollobás and Scott conjectured that every graph G has a balanced bipartite spanning subgraph H such that for each for each In this paper, we consider the contrary side and show that every graphic sequence has a realization G which admits a balanced ...
Guangnuan Li
doaj +1 more source
Relations on generalized degree sequences
Discrete Mathematics, 2009 final version, to appear in Discrete ...
Caroline J. Klivans +2 more
openaire +3 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 +2 more sources
Modifying a Graph's Degree Sequence and the Testablity of Degree Sequence Properties
CoRR, 2020 We show that if the degree sequence of a graph $G$ is close in $\ell_1$-distance to a given realizable degree sequence $(d_1,\dots,d_n)$, then $G$ is close in edit distance to a graph with degree sequence $(d_1,\dots,d_n)$. We then use this result to prove that every graph property defined in terms of the degree sequence is testable in the dense graph ...
openaire +2 more sources
3-Paths in Graphs with Bounded Average Degree
Discussiones Mathematicae Graph Theory, 2016 In this paper we study the existence of unavoidable paths on three vertices in sparse graphs. A path uvw on three vertices u, v, and w is of type (i, j, k) if the degree of u (respectively v, w) is at most i (respectively j, k). We prove that every graph
Jendrol Stanislav +3 more
doaj +1 more source