Results 31 to 40 of about 3,067,250 (321)
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
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
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
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
Realizing Degree Sequences in Parallel [PDF]
SIAM Journal on Discrete Mathematics, 1996 Summary: 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 degree 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\); the algorithm runs in \(O(\log n)\) time using \(O(n+ m)\)
Arikati, S., Maheshwari, A.
openaire +4 more sources
Empirical Likelihodd Methods for an AR(1) process with ARCH(1) errors [PDF]
, 2006 For an AR(1) process with ARCH(1) errors, we propose empirical likelihood tests for testing whether the sequence is strictly stationary but has infinite variance, or the sequence is an ARCH(1) sequence or the sequence is an iid sequence.
Klüppelberg, Claudia, Peng, Liang
core +2 more sources
Forcing $k$-Repetitions in Degree Sequences [PDF]
The Electronic Journal of Combinatorics, 2014 One of the most basic results in graph theory states that every graph with at least two vertices has two vertices with the same degree. Since there are graphs without $3$ vertices of the same degree, it is natural to ask if for any fixed $k$, every graph $G$ is "close" to a graph $G'$ with $k$ vertices of the same degree. Our main result in this paper
Caro, Yair +2 more
openaire +3 more sources
A Constructive Extension of the Characterization on Potentially Ks,t-Bigraphic Pairs
Discussiones Mathematicae Graph Theory, 2017 Let Ks,t be the complete bipartite graph with partite sets of size s and t. Let L1 = ([a1, b1], . . . , [am, bm]) and L2 = ([c1, d1], . . . , [cn, dn]) be two sequences of intervals consisting of nonnegative integers with a1 ≥ a2 ≥ . . . ≥ am and c1 ≥ c2
Guo Ji-Yun, Yin Jian-Hua
doaj +1 more source
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