Paley-like quasi-random graphs arising from polynomials [PDF]
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]
This paper uses the theory of covering graphs to characterize some of the edge-transitive graphs which can arise as token graphs.
arxiv
Good versus optimal: Why network analytic methods need more systematic evaluation
Zweig Katharina
doaj +1 more source
Algorithmic methods of finite discrete structures. Topological graph drawing (part I) [PDF]
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]
Sharma N, Yagoobi S, Traulsen A.
europepmc +1 more source
The Effect of Dopaminergic Therapy in Parkinson's Disease: A Graph Theory Analysis. [PDF]
Siva K+3 more
europepmc +1 more source
Rigidity percolation in a random tensegrity via analytic graph theory. [PDF]
Stephenson W+4 more
europepmc +1 more source
Graph theory approaches for molecular dynamics simulations. [PDF]
Patel AC, Sinha S, Palermo G.
europepmc +1 more source
Enhancing security in electromagnetic radiation therapy using fuzzy graph theory. [PDF]
Lal R, Singh RK, Nishad DK, Khalid S.
europepmc +1 more source
Controllability and heterogeneity of river networks using spectral graph theory approach. [PDF]
Sarker S+4 more
europepmc +1 more source