The Estrada Index
Hanyuan Deng, Slavko Radenković, Ivan Gutman (2009)
Zbornik Radova
Similarity:
Hanyuan Deng, Slavko Radenković, Ivan Gutman (2009)
Zbornik Radova
Similarity:
Ivan Gutman, Hanyuan Deng, Slavko Radenković (2011)
Zbornik Radova
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...
M. Tavakoli, F. Rahbarnia, A. R. Ashrafi (2013)
Kragujevac Journal of Mathematics
Similarity:
Ivan Gutman, Yeong Nan Yeh (1995)
Mathematica Slovaca
Similarity:
Ivan Gutman, Bojana Borovićanin (2011)
Zbornik Radova
Similarity:
M. Tavakoli, F. Rahbarnia, M. Mirzavaziri, A. R. Ashrafi, I. Gutman (2013)
Kragujevac Journal of Mathematics
Similarity:
Bijana Borovićanin, Ivan Gutman (2009)
Zbornik Radova
Similarity:
Marián Klešč, Jana Petrillová (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. For the path Pn of length n, the crossing numbers of Cartesian products G⃞Pn for all connected graphs G on five vertices are also known. In this paper, the crossing numbers of Cartesian products G⃞Pn for graphs G of order six are studied. Let H denote the unique tree of order six with two vertices of degree three. The main contribution is that the crossing number of the...