Results 1 to 10 of about 2,991,925 (319)
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 +2 more sources
Degree sequences and majorization
Linear Algebra and its Applications, 1994 The authors define the majorization gap of a degree sequence as the minimum number of successive reverse-unit-transformations required to transform it into a threshold sequence (i.e., the degree sequence of a threshold graph). They deduce a formula for the majorization gap (by establishing a lower bound for it and exhibiting reverse-unit ...
Srinivasa R. Arikati, Uri N. Peled
openalex +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
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
The polytope of degree sequences of hypergraphs
Linear Algebra and its Applications, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
N. L. Bhanu Murthy, Murali K. Srinivasan
openalex +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
Reciprocity of networks with degree correlations and arbitrary degree sequences [PDF]
Physical Review E, 2008 8 pages, 3 figures, added a new table and a new figure, accepted for publication in Phys.Rev ...
Gorka Zamora‐López +4 more
openalex +6 more sources
Hamiltonian degree sequences in digraphs
Journal of Combinatorial Theory, Series B, 2009 We show that for each >0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences d^+_1\le ... \le d^+_n and d^- _1 \le ... \le d^-_n satisfy (i) d^+_i \geq i+ n or d^-_{n-i- n} \geq n-i and (ii) d^-_i \geq i+ n or d^+_{n-i- n} \geq n-i for all i < n/2.
Daniela Kühn +2 more
openalex +4 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
ITM Web of Conferences, 2020 Special numbers have very important mathematical properties alongside their numerous applications in many fields of science. Probably the most important of those is the Fibonacci numbers.
Demirci Musa, Cangul Ismail Naci
doaj +1 more source