Results 41 to 50 of about 3,088,840 (140)
Counting and Averaging Problems in Graph Theory [PDF]
, 2010 Paul Gunther (1966), proved the following result: Given a continuous function f on a compact surface M of constant curvature -1 and its periodic lift g to the universal covering, the hyperbolic plane, then the averages of the lift g over increasing ...
DOUMA, FEMKE
core
Strongly Regular Graphs with Parameters (4m4, 2m4 + m2, m4 + m2, m4 + m2) Exist for All m>1 [PDF]
Using results on Hadamard difference sets, we construct regular graphical Hadamard matrices of negative type of order 4m4 for every positive integer m. If m > 1, such a Hadamard matrix is equivalent to a strongly regular graph with parameters (4m4, 2m4 ...
Xiang, Q., Haemers, W.H.
core
BMC PsychiatryBackground Subclinical depression (ScD), serving as a significant precursor to depression, is a prevalent condition in college students and imposes a substantial health service burden. However, the brain network topology of ScD remains poorly understood,
Bo Zhang +7 more
doaj +1 more source
Quasi-randomness and algorithmic regularity for graphs with general degree distributions [PDF]
, 2010 We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to express how much a given graph “resembles” a random one.
Schacht, Mathias +5 more
core +1 more source
Some Implications on Amorphic Association Schemes [PDF]
AMS classifications: 05E30, 05B20;amorphic association scheme;strongly regular graph;(negative) Latin square type;cyclotomic association scheme;strongly regular ...
Dam, E.R. van, Muzychuk, M.
core
, 2011 In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core +1 more source
Spectral Characterization of the Hamming Graphs [PDF]
We show that the Hamming graph H(3; q) with diameter three is uniquely determined by its spectrum for q ¸ 36. Moreover, we show that for given integer D ¸ 2, any graph cospectral with the Hamming graph H(D; q) is locally the disjoint union of D copies of
Koolen, J.H., Bang, S., Dam, E.R. van
core
Towards a Maude tool for model checking temporal graph properties [PDF]
, 2011 We present our prototypical tool for the verification of graph transformation systems. The major novelty of our tool is that it provides a model checker for temporal graph properties based on counterpart semantics for quantified m-calculi.
Lluch-Lafuente, Alberto +4 more
core +1 more source
Average tree solutions for graph games [PDF]
In this paper we consider cooperative graph games being TU-games in which players cooperate if they are connected in the communication graph. We focus our attention to the average tree solutions introduced by Herings, van der Laan and Talman [6] and ...
Remila, Eric +3 more
core
Finding planted partitions in random graphs with general degree distributions [PDF]
, 2009 We consider the problem of recovering a planted partition such as a coloring, a small bisection, or a large cut in an (apart from that) random graph. In the last 30 years many algorithms for this problem have been developed that work provably well on ...
Coja-Oghlan, Amin, Lanka, André
core +1 more source