Results 51 to 60 of about 9,193,291 (353)
On the reconstruction of the degree sequence
Discrete Mathematics, 2002 AbstractHarary's edge reconstruction conjecture states that a graph G=(V,E) with at least four edges is uniquely determined by the multiset of its edge-deleted subgraphs, i.e. the graphs of the form G−e for e∈E. It is well-known that this multiset uniquely determines the degree sequence of a graph with at least four edges.
Dieter Rautenbach +2 more
openaire +2 more sources
Realizing degree sequences in parallel [PDF]
SIAM Journal on Discrete Mathematics, 1994 A sequence d of integers is a degree sequence if there exists a (simple) graph G such that the components of d are equal to the degrees of the vertices of G. The graph G is said to be a realization of d. We provide an efficient parallel algorithm to realize d. Before our result, it was not known if the problem of realizing d is in NC.
Arikati, S., Maheshwari, A.
openaire +5 more sources
On balanced bipartitions of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Bollobás and Scott conjectured that every graph G has a balanced bipartite spanning subgraph H such that for each for each In this paper, we consider the contrary side and show that every graphic sequence has a realization G which admits a balanced ...
Guangnuan Li
doaj +1 more source
Degree Sequences and the Existence of k-Factors [PDF]
Graphs and Combinatorics, 2011 19 ...
Douglas C. Bauer +4 more
openalex +5 more sources
Evaluation of Infrared Detector Response Characteristics Drift Based on Time Sequence [PDF]
Hangkong bingqi, 2023 The response characteristic drift of infrared detector seriously degrades the imaging quality and system performance. Aiming at the lack of effective evaluation index and difficulty in modeling and evaluating the response characteristic drift of infrared
Hu Ruolan, Shang Chao, Wang Jinchun, Peng Jing
doaj +1 more source
Affiliation networks with an increasing degree sequence [PDF]
, 2017 Affiliation network is one kind of two-mode social network with two different sets of nodes (namely, a set of actors and a set of social events) and edges representing the affiliation of the actors with the social events. Although a number of statistical
Yong Zhang, Xiaodi Qian, H. Qin, T. Yan
semanticscholar +1 more source
Generation and analysis of networks with a prescribed degree sequence and subgraph family: higher-order structure matters [PDF]
J. Complex Networks, 2015 Designing algorithms that generate networks with a given degree sequence while varying both subgraph composition and distribution of subgraphs around nodes is an important but challenging research problem.
Martin Ritchie, L. Berthouze, I. Kiss
semanticscholar +1 more source
Finding the Zeros of a High-Degree Polynomial Sequence
Journal of Optimization, Differential Equations and Their Applications, 2021 A 1-parameter initial-boundary value problem for a linear spatially 1-dimensional homogeneous degenerate wave equation, posed in a space-time rectangle, in case of strong degeneracy, was reduced to a linear integro-differential equation of convolution ...
Vladimir L. Borsch, Peter I. Kogut
doaj +1 more source
Multi-switch: A tool for finding potential edge-disjoint 1-factors
Electronic Journal of Graph Theory and Applications, 2021 Let n be even, let π = (d1, ... , dn) be a graphic degree sequence, and let π - k = (d1-k, ... , dn-k) also be graphic. Kundu proved that π has a realization G containing a k-factor, or k-regular graph.
Tyler Seacrest
doaj +1 more source
Smallest domination number and largest independence number of graphs and forests with given degree sequence [PDF]
Journal of Graph Theory, 2015 For a sequence d of nonnegative integers, let G(d) and F(d) be the sets of all graphs and forests with degree sequence d, respectively. Let γmin(d)=min{γ(G):G∈G(d)} , αmax(d)=max{α(G):G∈G(d)} , γminF(d)=min{γ(F):F∈F(d)} , and αmaxF(d)=max{α(F):F∈F(d ...
Michael Gentner +2 more
semanticscholar +1 more source