Results 31 to 40 of about 3,049,614 (273)
A General Computational Approach for Counting Labeled Graphs
Algorithms, 2022 This paper presents a general recursive formula to estimate the number of labeled graphs as well as details to evaluate the formula for the following graph properties: number of edges (graph density), degree sequence, degree distribution, classification ...
Ravi Goyal, Victor De Gruttola
doaj +1 more source
On the Grone-Merris conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Grone and Merris [GM94] conjectured that the Laplacian spectrum of a graph is majorized by its conjugate vertex degree sequence. We prove that this conjecture holds for a class of graphs including trees.
Tamon Stephen
doaj +1 more source
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
Degree Sequences of Infinite Graphs [PDF]
Journal of the London Mathematical Society, 1981 Peer Reviewed ; http://deepblue.lib.umich.edu/bitstream/2027.42/135582/1/jlms0010 ...
Blass, Andreas, Harary, Frank
openaire +2 more sources
On the necessity of Chvátal’s Hamiltonian degree condition
AKCE International Journal of Graphs and Combinatorics, 2020 In 1972 Chvátal gave a well-known sufficient condition for a graphical sequence to be forcibly Hamiltonian, and showed that in some sense his condition is best possible.
Douglas Bauer +3 more
doaj +1 more source
On the swap-distances of different realizations of a graphical degree sequence [PDF]
, 2013 One of the first graph theoretical problems which got serious attention (already in the fifties of the last century) was to decide whether a given integer sequence is equal to the degree sequence of a simple graph (or it is {\em graphical} for short ...
Erdős +7 more
core +2 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
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