The sum of all distances in bipartite graphs
Ivan Gutman, Yeong Nan Yeh (1995)
Mathematica Slovaca
Similarity:
Ivan Gutman, Yeong Nan Yeh (1995)
Mathematica Slovaca
Similarity:
Abbas, N., Culberson, J., Stewart, L. (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Gutman, Ivan (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Richard Brewster, Christina Mynhardt, Laura Teshima (2013)
Open Mathematics
Similarity:
A dominating broadcast on a graph G = (V, E) is a function f: V → {0, 1, ..., diam G} such that f(v) ≤ e(v) (the eccentricity of v) for all v ∈ V and such that each vertex is within distance f(v) from a vertex v with f(v) > 0. The cost of a broadcast f is σ(f) = Σv∈V f(v), and the broadcast number λ b (G) is the minimum cost of a dominating broadcast. A set X ⊆ V(G) is said to be irredundant if each x ∈ X dominates a vertex y that is not dominated by any other vertex in X; possibly...
Yousef Alavi, Don R. Lick, Song Lin Tian (1989)
Mathematica Slovaca
Similarity:
Ferdinand Gliviak (1975)
Matematický časopis
Similarity:
Peter Horák (1982)
Mathematica Slovaca
Similarity:
Mark Schurch, Christine Mynhardt (2014)
Discussiones Mathematicae Graph Theory
Similarity:
An edge ordering of a graph G is an injection f : E(G) → R, the set of real numbers. A path in G for which the edge ordering f increases along its edge sequence is called an f-ascent ; an f-ascent is maximal if it is not contained in a longer f-ascent. The depression of G is the smallest integer k such that any edge ordering f has a maximal f-ascent of length at most k. A k-kernel of a graph G is a set of vertices U ⊆ V (G) such that for any edge ordering f of G there exists a maximal...