Results 11 to 20 of about 3,049,614 (273)
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
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
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
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
Enumeration of graphs with a heavy-tailed degree sequence [PDF]
Advances in Mathematics, 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 +3 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
Random graphs with a given degree sequence
Annals of Applied Probability, 2011 Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have graph limits in
Chatterjee, Sourav +2 more
core +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
Mathematics, 2022 Let G(V,X) be a finite and simple graph of order n and size m. The complement of G, denoted by G¯, is the graph obtained by removing the lines of G and adding the lines that are not in G.
Amrithalakshmi Pai +4 more
doaj +1 more source