Results 241 to 250 of about 322,612 (279)
On the graph theory of majority illusions: theoretical results and computational experiments. [PDF]
Auton Agent Multi Agent SystVenema-Los M, Christoff Z, Grossi D.
europepmc +1 more source
Most Ventral Pallidal Cholinergic Neurons Are Bursting Basal Forebrain Cholinergic Neurons with Mesocorticolimbic Connectivity. [PDF]
J NeurosciSchlingloff D +6 more
europepmc +1 more source
Maximizing performance in child footballers: chronotype and time of day study. [PDF]
Front PhysiolKaba I +8 more
europepmc +1 more source
Microbiota-driven therapeutic efficacy of Hyperoside in ulcerative colitis and associated anxiety. [PDF]
Front Cell Infect MicrobiolYin L +5 more
europepmc +1 more source
Graphs cospectral with distance-regular graphs
, 1993 Haemers, W.H., Spence, E.
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of the London Mathematical Society, 1986
This paper completes the classification of cubic distance-regular graphs. We define the profile and period of certain cycles in such a graph, and obtain congruence conditions on the periods that help determine the feasible intersection arrays. It turns out that there are just 13 possible cases and in each case the array is realised by a unique graph.
Biggs, N.L. +2 more
openaire +2 more sources
This paper completes the classification of cubic distance-regular graphs. We define the profile and period of certain cycles in such a graph, and obtain congruence conditions on the periods that help determine the feasible intersection arrays. It turns out that there are just 13 possible cases and in each case the array is realised by a unique graph.
Biggs, N.L. +2 more
openaire +2 more sources
1978
Inequalities are obtained between the various parameters of a distance-regular graph. In particular, if k1 is the valency and k2 is the number of vertices at distance two from a given vertex, then in general k1 ⩽ k2. For distance-regular graphs of diameter at least four, k1=k2 if and only if the graph is simply a circuit.
D. E. Taylor, Richard Levingston
openaire +1 more source
Inequalities are obtained between the various parameters of a distance-regular graph. In particular, if k1 is the valency and k2 is the number of vertices at distance two from a given vertex, then in general k1 ⩽ k2. For distance-regular graphs of diameter at least four, k1=k2 if and only if the graph is simply a circuit.
D. E. Taylor, Richard Levingston
openaire +1 more source
Bipartite distance-regular graphs. II
Graphs and Combinatorics, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources