Results 31 to 40 of about 971,776 (299)
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 degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 Assume that $n, \delta ,k$ are integers with $0 \leq k < \delta < n$. Given a graph $G=(V,E)$ with $|V|=n$. The symbol $G-F, F \subseteq V$, denotes the graph with $V(G-F)=V-F$, and $E(G-F)$ obtained by $E$ after deleting the edges with at least one ...
Shih-Yan Chen, Shin-Shin Kao, Hsun Su
doaj +1 more source
The Random Plots Graph Generation Model for Studying Systems with Unknown Connection Structures
Entropy, 2022 We consider the problem of modeling complex systems where little or nothing is known about the structure of the connections between the elements. In particular, when such systems are to be modeled by graphs, it is unclear what vertex degree distributions
Evgeny Ivanko, Mikhail Chernoskutov
doaj +1 more source
Ubiquity, 2008 I ndi got her BS in Computer Science from Cal Poly and began her master's at Colorado State. She then worked as a software engineer, later managing Web applications that focused on the user. Her concepts in mental models derive from attempting to bridge the developer-user gap.
Saptarshi Naskar +3 more
openaire +1 more source
Symmetric bipartite graphs and graphs with loops [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Grant Cairns, Stacey Mendan
doaj +1 more source
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
Spectral ordering and 2-switch transformations [PDF]
The American Journal of Combinatorics, 2022 We address the problem of ordering trees with the same degree sequence by their spectral radii. To achieve that, we consider 2-switch transformations which preserve the degree sequence and establish when the index decreases.
Elismar Oliveira +2 more
doaj +3 more sources
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
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
An inequality for degree sequences
Discrete Mathematics, 1992 The authors prove that \[ \left(\sum^ n_{i=1} d^{1/p}_ i\right)^ p\geq \sum^ n_{i=1} d^ p_ i \] for the degree sequence \(d_ 1,\dots,d_ n\) of a simple graph and \(p\) a positive integer. Moreover, they analyze also related ``real'' inequalities. Some partial results are interesting for their own sake, e.g.
László A. Székely +2 more
openaire +2 more sources