Results 1 to 10 of about 3,067,250 (321)
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
On the Swap-Distances of Different Realizations of a Graphical Degree Sequence [PDF]
, 2013 One of the first graph theoretical problems which got serious attention (already in the fifties of the last century) was to decide whether a given integer sequence is equal to the degree sequence of a simple graph (or it is {\em graphical} for short ...
Péter L. Erdős +2 more
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
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
Degree Sequence Index Strategy [PDF]
, 2012 We introduce a procedure, called the Degree Sequence Index Strategy (DSI), by which to bound graph invariants by certain indices in the ordered degree sequence.
Caro, Yair, Pepper, Ryan
core +2 more sources
Cyclic Hypergraph Degree Sequences [PDF]
, 2017 The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of sufficient conditions for a degree sequence to be {\em hypergraphic}.
Syed Mohammad Meesum
openalex +3 more sources
The component sizes of a critical random graph with given degree sequence [PDF]
, 2010 Consider a critical random multigraph $\mathcal{G}_n$ with $n$ vertices constructed by the configuration model such that its vertex degrees are independent random variables with the same distribution $\nu$ (criticality means that the second moment of ...
Adrien Joseph
openalex +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