نتایج جستجو برای: strongly distance balanced graph
تعداد نتایج: 670466 فیلتر نتایج به سال:
We construct two-intersection sets in PG(5, q), q odd, admitting PSL(2, q), whose associated strongly regular graphs have the same parameters as, but are not isomorphic to, Paley graphs.
Similarity analytic techniques such as distance based joins and regularized learningmodels are critical tools employed in numerous data mining and machine learning tasks. We focus on two typical techniques in the context of large scale data and distributed clusters. Advanced distance metrics such as the Earth Mover’s Distance (EMD) are usually employed to capture the similarity between data dim...
Accurate and fast path computation is essential for applications such as onboard navigation systems and traffic network routing. While a number of heuristic algorithms have been developed in the past few years for faster path queries, the accuracy of them are always far below satisfying. In this paper, we first develop an agglomerative graph partitioning method for generating high balanced trav...
R. E. Jamison proved that every cycle of length greater than three in a graph has a chord—in other words, the graph is chordal—if and only if every k-cycle is the sum of k − 2 triangles. This result generalizes to having or not having crossing chords and to having strong chords, with similar characterizations of a variety of graph classes that includes chordal bipartite, distance-hereditary, an...
the wiener index w(g) of a connected graph g is defined as the sum of the distances betweenall unordered pairs of vertices of g. the eccentricity of a vertex v in g is the distance to avertex farthest from v. in this paper we obtain the wiener index of a graph in terms ofeccentricities. further we extend these results to the self-centered graphs.
For real numbers c, ε > 0, let Gc,ε denote the class of graphs G such that each subgraph H of G has a balanced separator of order at most c|V (H)|1−ε. A class G of graphs has strongly sublinear separators if G ⊆ Gc,ε for some c, ε > 0. We investigate properties of such graph classes, leading in particular to an approximate algorithm to determine membership in Gc,ε: there exist c > 0 such that f...
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are introduced two at the time, in a random order. For each pair of edges, Painter immediately and irrevocably chooses one of the two possibilities to color one of them red and the other one blue. His goal is to avoid crea...
E. R. van Dam gave an example of primitive non-amorphous association schemes in which every nontrivial relation is a strongly regular graph, as a fusion scheme of the cyclotomic scheme of class 45 on GF(212). The aim of this paper is to present a new example of primitive non-amorphous association schemes in which every nontrivial relation is a strongly regular graph, as a fusion scheme of the c...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید