Results 171 to 180 of about 38,382 (189)
Synteny plot quality control with SyntenyQC. [PDF]
BioinformaticsKirkwood TDJ +5 more
europepmc +1 more source
A characterization for fuzzy strong cut vertices and fuzzy strong cut edges. [PDF]
Sci RepMa J, Shen L, Li L.
europepmc +1 more source
Restless reachability problems in temporal graphs. [PDF]
Knowl Inf SystThejaswi S, Lauri J, Gionis A.
europepmc +1 more source
Classification of Cubic Edge-Transitive Graphs of Order 14p2
, 2012 Mehdi ALAEİYAN, Mohsen LASHANİ
openalex +1 more source
A Scoping Review of Multilevel Patient-Sharing Network Measures in Health Services Research. [PDF]
Med Care Res RevKorsberg A +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Discrete Mathematics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ju Zhang, Jin-Xin Zhou
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ju Zhang, Jin-Xin Zhou
openaire +2 more sources
Journal of Graph Theory, 1987
AbstractGraphs which are more or less “symmetric” in one sense or another have been the subject of many investigations. In particular, finite graphs in which all edges are equivalent under isomorphisms of the graph have attracted some attention (see, for example, Fleischner and Imrich [2], Grünbaum and Shephard [5]).
Grünbaum, Branko, Shephard, G. C.
openaire +2 more sources
AbstractGraphs which are more or less “symmetric” in one sense or another have been the subject of many investigations. In particular, finite graphs in which all edges are equivalent under isomorphisms of the graph have attracted some attention (see, for example, Fleischner and Imrich [2], Grünbaum and Shephard [5]).
Grünbaum, Branko, Shephard, G. C.
openaire +2 more sources
Random walks on edge-transitive graphs (II)
Statistics & Probability Letters, 1999[For part I (by the first and second author) see ibid. 37, No. 1, 29-34 (1998; Zbl 0901.60044).] The authors give formulas, in terms of the number of pure \(k\)-cycles, for the expected hitting times between vertices at distances greater than 1 for random walks on edge-transitive graphs.
Palacios, José Luis +2 more
openaire +2 more sources
Hexavalent edge-transitive graphs of order $$3p^2$$
Journal of Algebraic Combinatorics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Song-Tao Guo, Li Wang
openaire +2 more sources