Results 41 to 50 of about 971,776 (299)
An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences
Theory and Applications of Graphs, 2021 As a partial answer to a question of Rao, a deterministic and customizable efficient algorithm is presented to test whether an arbitrary graphical degree sequence has a bipartite realization.
Kai Wang
doaj +1 more source
Informatica, 2019 Assume that we are given two graphic sequences, $\pi_1$ and $\pi_2$. We consider conditions for $\pi_1$ and $\pi_2$ which guarantee that there exists a simple graph $G_2$ realizing $\pi_2$ such that $G_2$ is the subgraph of any simple graph $G_1$ that realizes $\pi_1$.
Béla Csaba, Bálint Vásárhelyi
openaire +3 more sources
Discussiones Mathematicae Graph Theory, 2020 Let S = (a1,. . . , am; b1, . . . , bn), where a1, . . . , am and b1, . . . , bn are two sequences of nonnegative integers. We say that S is a bigraphic pair if there exists a simple bipartite graph G with partite sets {x1, x2, . . . , xm} and {y1, y2, .
Yin Jian-Hua, Li Sha-Sha
doaj +1 more source
On the Distance Spectral Radius of Trees with Given Degree Sequence
Discussiones Mathematicae Graph Theory, 2020 We consider the problem of maximizing the distance spectral radius and a slight generalization thereof among all trees with some prescribed degree sequence.
Dadedzi Kenneth +2 more
doaj +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
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
Extremal trees with fixed degree sequence
, 2021 The greedy tree G(D) and the M-tree M(D) are known to be extremal among trees with degree sequence D with respect to various graph invariants. This paper provides a general theorem that covers a large family of invariants for which G(D) or M(D) is ...
Andriantiana, Eric O. D., +5 more
core +1 more source
Fully graphic degree sequences and P-stable degree sequences
Advances in Applied Mathematics23 pages, 1 ...
Péter L. Erdös +2 more
openaire +4 more sources
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
Reciprocity of networks with degree correlations and arbitrary degree sequences [PDF]
Physical Review E, 2008 8 pages, 3 figures, added a new table and a new figure, accepted for publication in Phys.Rev ...
Zamora-Lopez, Gorka +4 more
openaire +4 more sources