Results 21 to 30 of about 971,776 (299)
Extremal trees with given degree sequence for the Randić index
Discrete Mathematics, 2008 The Randić index of a graph G is the sum of ((d(u))(d(v)))α over all edges uv of G, where d(v) denotes the degree of v in G, α≠0. When α=1, it is the weight of a graph. Delorme, Favaron, and Rautenbach characterized the trees with a given degree sequence
Wang, Hua
exaly +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
Largest component of subcritical random graphs with given degree sequence [PDF]
, 2023 We study the size of the largest component of two models of random graphs with prescribed degree sequence, the configuration model (CM) and the uniform model (UM), in the (barely) subcritical regime.
Coulson, Matthew John +1 more
core +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 +3 more sources
Packing Tree Degree Sequences [PDF]
Graphs and Combinatorics, 2019 AbstractA degree sequence is a list of non-negative integers, $${D = d_1, d_2, \ldots , d_n}$$D=d1,d2,…,dn. It is called graphical if there exists a simple graph G such that the degree of the ith vertex is $$d_i$$di; G is then said to be a realization of D. A tree degree sequence is one that is realized by a tree.
Kristóf Bérczi +3 more
openaire +6 more sources
Degree Sequence Bound for Join Cardinality Estimation [PDF]
, 2023 Recent work has demonstrated the catastrophic effects of poor cardinality estimates on query processing time. In particular, underestimating query cardinality can result in overly optimistic query plans which take orders of magnitude longer to complete ...
Balazinska, Magda +3 more
core +1 more source
The irregularity of two types of trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The irregularity of a graph $G$ is defined as the sum of weights $|d(u)-d(v)|$ of all edges $uv$ of $G$, where $d(u)$ and $d(v)$ are the degrees of the vertices $u$ and $v$ in $G$, respectively.
Li Jianxi, Yang Liu, Wai Shiu
doaj +1 more source
Optimization over Degree Sequences [PDF]
SIAM Journal on Discrete Mathematics, 2018 We introduce and study the problem of optimizing arbitrary functions over degree sequences of hypergraphs and multihypergraphs. We show that over multihypergraphs the problem can be solved in polynomial time. For hypergraphs, we show that deciding if a given sequence is the degree sequence of a 3-hypergraph is NP-complete, thereby solving a 30 year ...
Antoine Deza +3 more
openaire +2 more sources