Results 61 to 70 of about 795,931 (124)
Hamiltonicity of Vertex-Transitive Graphs of Order $4p$ [PDF]
arXiv, 2006 It is shown that every connected vertex-transitive graph of order $4p$, where $p$ is a prime, is hamiltonian with the exception of the Coxeter graph which is known to possess a Hamilton path.
arxiv
Upper and lower bounds based on linear programming for the b-coloring problem
EURO Journal on Computational Optimization, 2022 B-coloring is a problem in graph theory. It can model some real applications, as well as being used to enhance solution methods for the classical graph coloring problem. In turn, improved solutions for the classical coloring problem would impact a larger
Roberto Montemanni +2 more
doaj
Graph Signal Processing: Modulation, Convolution, and Sampling [PDF]
arXiv, 2019 To analyze data supported by arbitrary graphs G, DSP has been extended to Graph Signal Processing (GSP) by redefining traditional DSP concepts like shift, filtering, and Fourier transform among others. This paper revisits modulation, convolution, and sampling of graph signals as appropriate natural extensions of the corresponding DSP concepts.
arxiv
Study of eccentricity based topological indices for benzenoid structure
South African Journal of Chemical Engineering, 2023 Topological indices play paramount role in defining chemical and structural properties of different compounds. Chemical graph theory is useful for predicting the bioactivity and physicochemical properties through numerical invariants.
Kamel Jebreen +5 more
doaj
On the Isomorphism Problem of Cayley Graphs of Graph Products [PDF]
arXivWe investigate Cayley graphs of graph products by showing that graph products with vertex groups that have isomorphic Cayley graphs yield isomorphic Cayley graphs.
arxiv
Planted Models for $k$-way Edge and Vertex Expansion [PDF]
arXiv, 2019 Graph partitioning problems are a central topic of study in algorithms and complexity theory. Edge expansion and vertex expansion, two popular graph partitioning objectives, seek a $2$-partition of the vertex set of the graph that minimizes the considered objective.
arxiv
Cayley properties of merged Johnson graphs [PDF]
arXiv, 2015 Extending earlier results of Godsil and of Dobson and Malnic on Johnson graphs, we characterise those merged Johnson graphs $J=J(n,k)_I$ which are Cayley graphs, that is, which are connected and have a group of automorphisms acting regularly on the vertices.
arxiv
Vertex-transitive Haar graphs that are not Cayley graphs [PDF]
arXiv, 2016 In a recent paper (arXiv:1505.01475 ) Est\'elyi and Pisanski raised a question whether there exist vertex-transitive Haar graphs that are not Cayley graphs. In this note we construct an infinite family of trivalent Haar graphs that are vertex-transitive but non-Cayley.
arxiv
Period Preserving Properties of an Invariant from the Permanent of Signed Incidence Matrices [PDF]
arXiv, 2015 A 4-point Feynman diagram in scalar $\phi^4$ theory is represented by a graph $G$ which is obtained from a connected 4-regular graph by deleting a vertex. The associated Feynman integral gives a quantity called the period of $G$ which is invariant under a number of meaningful graph operations - namely, planar duality, the Schnetz twist, and it also ...
arxiv
Известия Томского политехнического университета: Инжиниринг георесурсов, 2017 Increasing of diagnosis accuracy of the technical condition and energy efficiency of the rolling stock traction motor is one of the current problems of the modern railway transport.
Viktor Vasilievich Kharlamov +3 more
doaj +2 more sources