Results 101 to 110 of about 2,078,525 (187)

Paley-like quasi-random graphs arising from polynomials [PDF]

open access: yesarXiv
Paley graphs and Paley sum graphs are classical examples of quasi-random graphs. In this paper, we provide new constructions of families of quasi-random graphs that behave like Paley graphs but are neither Cayley graphs nor Cayley sum graphs. These graphs give a unified perspective of studying various graphs arising from polynomials over finite fields ...
arxiv  

Edge-transitive token graphs as covers [PDF]

open access: yesarXiv
This paper uses the theory of covering graphs to characterize some of the edge-transitive graphs which can arise as token graphs.
arxiv  

Algorithmic methods of finite discrete structures. Topological graph drawing (part I) [PDF]

open access: yesarXiv
Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing the planarization process by algebraic methods, without making any geometric constructions on the plane ...
arxiv  

Self-loops in evolutionary graph theory: Friends or foes? [PDF]

open access: yesPLoS Comput Biol, 2023
Sharma N, Yagoobi S, Traulsen A.
europepmc   +1 more source

Rigidity percolation in a random tensegrity via analytic graph theory. [PDF]

open access: yesProc Natl Acad Sci U S A, 2023
Stephenson W   +4 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy