Results 141 to 150 of about 1,592 (153)
Topological Characterization of Metal-Organic Frameworks: A Perspective. [PDF]
Chem MaterGlasby LT +3 more
europepmc +1 more source
Further Exploration of an Upper Bound for Kemeny's Constant. [PDF]
Entropy (Basel)Kooij RE, Dubbeldam JLA.
europepmc +1 more source
Ontological approach for competency-based curriculum analysis. [PDF]
HeliyonMilosz M +5 more
europepmc +1 more source
Counting Cherry Reduction Sequences in Phylogenetic Tree-Child Networks is Counting Linear Extensions. [PDF]
Bull Math BiolCoronado TM, Pons JC, Riera G.
europepmc +1 more source
Rule-level verification of graph transformations for invariants based on edges' transitive closure
, 2013 Christian Percebois +2 more
openalex +1 more source
SparkDWM: a scalable design of a Data Washing Machine using Apache Spark. [PDF]
Front Big DataHagan NKA, Talburt JR.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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]).
Branko Grünbaum, Geoffrey C. Shephard
openaire +3 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]).
Branko Grünbaum, Geoffrey C. Shephard
openaire +3 more sources
Random walks on edge-transitive graphs (II)
Statistics & Probability Letters, 1998The authors find explicit values for the expected hitting times between neighboring vertices of random walks on edge-transitive graphs, extending some results obtained by van Slijpe (1986), Aldous (1989), Devroye and Sbihi (1990) and Palacios (1992).
José Miguel Renom +2 more
openaire +4 more sources
On Reconstruction of Normal Edge-Transitive Cayley Graphs
Annals of Combinatorics, 2020The main idea of this paper is to provide an algebraic algorithm for constructing symmetric graphs with optimal fault tolerance. For this purpose, we use normal edge-transitive Cayley graphs and the idea of reconstruction question posed by Praeger to present a special factorization of groups which induces a graphical decomposition of normal edge ...
Bahman Khosravi +2 more
openaire +2 more sources