Results 141 to 150 of about 1,557,851 (153)
Efficient stochastic epidemic simulation via the Sellke construction
Bootsma MC, van Boven M.
europepmc +1 more source
Antimagic Labeling of Regular Graphs
A graph G = (V, E ) is antimagic if there is a one-to-one correspondence f : E → {1, 2,..., |E|} such that for any two vertices u, v, Σe∈ E(u) f(e)≠Σe∈E(v ) f(e).
Xuding Zhu, Yu-Chang Liang
exaly +2 more sources
This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the ...
Hajime Tanaka +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
S-Regular Cubic Graphs as Coverings of the Complete Bipartite Graph K3,3
Journal of Graph Theory, 2004Yan-Quan Feng, Jin Ho Kwak
exaly
Spectra and Energies of Iterated Line Graphs of Regular Graphs
Applied Mathematics Letters, 2005Ivan Gutman, S B Rao
exaly
Periodicities of Grover Walks on Distance-Regular Graphs
Graphs and Combinatorics, 2019Yusuke Yoshie
exaly

