Results 11 to 20 of about 971,776 (299)
Degree sequence for k-arc strongly connected multiple digraphs [PDF]
Journal of Inequalities and Applications, 2017 Let D be a digraph on { v 1 , … , v n } $\{v_{1},\ldots, v_{n}\}$ . Then the sequence { ( d + ( v 1 ) , d − ( v 1 ) ) , … , ( d + ( v n ) , d − ( v n ) ) } $\{ (d^{+}(v_{1}), d^{-}(v_{1})), \ldots, (d^{+}(v_{n}), d^{-}(v_{n}))\}$ is called the degree ...
Yanmei Hong, Qinghai Liu
doaj +3 more sources
Degree sequence and supereulerian graphs
Discrete Mathematics, 2008 A sequence d=(d1,d2,…,dn) is graphic if there is a simple graph G with degree sequence d, and such a graph G is called a realization of d. A graphic sequence d is line-hamiltonian if d has a realization G such that L(G) is hamiltonian, and is ...
Suohai Fan +2 more
exaly +4 more sources
Controllability of deterministic networks with the identical degree sequence. [PDF]
PLoS ONE, 2015 Controlling complex network is an essential problem in network science and engineering. Recent advances indicate that the controllability of complex network is dependent on the network's topology.
Xiujuan Ma, Haixing Zhao, Binghong Wang
doaj +2 more sources
A degree sequence Komlós theorem [PDF]
SIAM Journal on Discrete Mathematics, 2019 An important result of Komlós [Tiling Turán theorems, Combinatorica, 2000] yields the asymptotically exact minimum degree threshold that ensures a graph $G$ contains an $H$-tiling covering an $x$th proportion of the vertices of $G$ (for any fixed $x \in (
Hyde, Joseph +2 more
core +4 more sources
The Effect of Random Edge Removal on Network Degree Sequence. [PDF]
Electron J Comb, 2012 Many networks arise in a random and distributed fashion, and yet result in having a specific type of degree structure: e.g., the WWW, many social networks, biological networks, etc., exhibit power-law, stretched exponential, or similar degree structures.
Dubois T, Eubank S, Srinivasan A.
europepmc +5 more sources
Degree Sequences of Monocore Graphs
Discussiones Mathematicae Graph Theory, 2014 A k-monocore graph is a graph which has its minimum degree and degeneracy both equal to k. Integer sequences that can be the degree sequence of some k-monocore graph are characterized as follows. A nonincreasing sequence of integers d0, . . . , dn is the
Bickle Allan
doaj +3 more sources
Constructing and sampling partite, 3-uniform hypergraphs with given degree sequence [PDF]
PLoS ONEPartite, 3-uniform hypergraphs are 3-uniform hypergraphs in which each hyperedge contains exactly one point from each of the 3 disjoint vertex classes. We consider the degree sequence problem of partite, 3-uniform hypergraphs, that is, to decide if such ...
András Hubai +4 more
doaj +4 more sources
Efficient and exact sampling of simple graphs with given arbitrary degree sequence. [PDF]
PLoS ONE, 2010 Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications ranging from epidemics, through social networks to Internet modeling.
Charo I Del Genio +3 more
doaj +2 more sources
On the reconstruction of the degree sequence
Discrete Mathematics, 2002 Harary's edge reconstruction conjecture states that a graph G=(V,E) with at least four edges is uniquely determined by the multiset of its edge-deleted subgraphs, i.e. the graphs of the form G−e for e∈E.
Odile Favaron +5 more
core +3 more sources
Adjacency Relationships Forced by a Degree Sequence
Graphs and Combinatorics, 2018 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
exaly +3 more sources