Results 41 to 50 of about 587,527 (280)
Querying Regular Graph Patterns [PDF]
Journal of the ACM, 2014 Graph data appears in a variety of application domains, and many uses of it, such as querying, matching, and transforming data, naturally result in incompletely specified graph data, that is, graph patterns. While queries need to be posed against such data, techniques for querying patterns are generally lacking, and properties of such queries are not ...
Barcelo, Pablo +2 more
openaire +6 more sources
Robustness of Random Graphs Based on Natural Connectivity [PDF]
, 2010 Recently, it has been proposed that the natural connectivity can be used to efficiently characterise the robustness of complex networks. Natural connectivity quantifies the redundancy of alternative routes in a network by evaluating the weighted number ...
Barahona, Mauricio +3 more
core +1 more source
Explicitly solvable cases of one-dimensional quantum chaos [PDF]
, 2001 We identify a set of quantum graphs with unique and precisely defined spectral properties called {\it regular quantum graphs}. Although chaotic in their classical limit with positive topological entropy, regular quantum graphs are explicitly solvable ...
E. B. Bogomolny +21 more
core +3 more sources
Journal of Combinatorial Theory, Series B, 1971 AbstractThis paper is a continuation of [1] and we shall use the same terminology. The main result of this part is the following: Suppose that the automorphism group of a connected graph of valency p + 1, p a prime, has a subgroup which acts as a regular permutation group on the set of s-arcs of the graph. Then s ≤ 7 and s ≠ 6.
openaire +3 more sources
Distance-regular Cayley graphs with small valency
, 2019 We consider the problem of which distance-regular graphs with small valency are Cayley graphs. We determine the distance-regular Cayley graphs with valency at most $4$, the Cayley graphs among the distance-regular graphs with known putative intersection ...
Jazaeri, Mojtaba, van Dam, Edwin R.
core +1 more source
Walk entropies on graphs [PDF]
, 2014 Entropies based on walks on graphs and on their line-graphs are defined. They are based on the summation over diagonal and off-diagonal elements of the thermal Green’s function of a graph also known as the communicability. The walk entropies are strongly
de la Peña, José A. +2 more
core +1 more source
Local algorithms, regular graphs of large girth, and random regular graphs
, 2016 We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random regular graphs into (
Hoppen, Carlos, Wormald, Nicholas
core +1 more source
Some Results on Pendant Regular Graphs
Pan-American Journal of Mathematics, 2023 Let G = (V, E) be a simple connected graph with o(G) = n and s(G) = m. A graph with pendant vertices is called Pendant Graphs or simply P-Graphs. In this paper we define the regularity of Pendant Graphs w.r.t.
Suji Elizabeth Mathew +1 more
doaj +1 more source
Another construction of edge-regular graphs with regular cliques
, 2018 We exhibit a new construction of edge-regular graphs with regular cliques that are not strongly regular. The infinite family of graphs resulting from this construction includes an edge-regular graph with parameters $(24,8,2)$.
Greaves, Gary R. W., Koolen, J. H.
core +1 more source
Tau acetylation at K331 has limited impact on tau pathology in vivo
FEBS Letters, EarlyView.We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto +3 more
wiley +1 more source