Dragan Stevanović (2005)
Mathematica Bohemica
Similarity:
We find all connected graphs in which any two distinct vertices have exactly two common neighbors, thus solving a problem by B. Zelinka.
Hopkins, Glenn, Staton, William (1989)
International Journal of Mathematics and Mathematical Sciences
Similarity:
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...
Bohdan Zelinka (1976)
Mathematica Slovaca
Similarity:
Roger C. Entringer, Douglas E. Jackson, D. A. Snyder (1976)
Czechoslovak Mathematical Journal
Similarity:
K. CH. Das, I. Gutman, D. Vukičević (2011)
Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques
Similarity:
Znám, Š. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity: