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

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

Displaying similar documents to “Tight bounds for quasirandom rumor spreading.”

Even kernels.

Fraenkel, Aviezri (1994)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Total vertex irregularity strength of disjoint union of Helm graphs

Ali Ahmad, E.T. Baskoro, M. Imran (2012)

Discussiones Mathematicae Graph Theory

Similarity:

A total vertex irregular k-labeling φ of a graph G is a labeling of the vertices and edges of G with labels from the set {1,2,...,k} in such a way that for any two different vertices x and y their weights wt(x) and wt(y) are distinct. Here, the weight of a vertex x in G is the sum of the label of x and the labels of all edges incident with the vertex x. The minimum k for which the graph G has a vertex irregular total k-labeling is called the total vertex irregularity strength of G. We...