Results 1 to 10 of about 5,011,430 (289)
Degree sequence and supereulerian graphs [PDF]
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong-Jian Lai +2 more
exaly +5 more sources
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
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 +4 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
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
An extremal problem on potentially K_p,1,1-graphic sequences [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 A sequence S is potentially K_p,1,1 graphical if it has a realization containing a K_p,1,1 as a subgraph, where K_p,1,1 is a complete 3-partite graph with partition sizes p,1,1.
Chunhui Lai
doaj +1 more source
On degree sequence optimization [PDF]
Operations Research Letters, 2020 We consider the problem of finding a subgraph of a given graph which maximizes a given function evaluated at its degree sequence. While the problem is intractable already for convex functions, we show that it can be solved in polynomial time for convex multi-criteria objectives.
openaire +4 more sources