The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Duality of real and quaternionic random matrices.”

On the total domination subdivision numbers in graphs

Seyed Sheikholeslami (2010)

Open Mathematics

Similarity:

A set S of vertices of a graph G = (V, E) without isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total domination number γ t(G) is the minimum cardinality of a total dominating set of G. The total domination subdivision number sdγt (G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the total domination number. Karami, Khoeilar, Sheikholeslami and Khodkar,...

Fruit salad.

Gyárfás, András (1997)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On the norms of the random walks on planar graphs

Andrzej Żuk (1997)

Annales de l'institut Fourier

Similarity:

We consider the nearest neighbor random walk on planar graphs. For certain families of these graphs, we give explicit upper bounds on the norm of the random walk operator in terms of the minimal number of edges at each vertex. We show that for a wide range of planar graphs the spectral radius of the random walk is less than one.