Minimal size of a graph with diameter 2 and given maximal degree. II.
Znám, Š. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Displaying similar documents to “The ramsey number for theta graph versus a clique of order three and four”
Minimal size of a graph with diameter 2 and given maximal degree. II.
On the number of cut-vertices in a graph.
Hopkins, Glenn, Staton, William (1989)
International Journal of Mathematics and Mathematical Sciences
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...
Maximal pentagonal packings.
Černý, A., Horák, P., Rosa, A., Znám, Š. (1996)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
On graphs with prescribed edge neighbourhoods
Dalibor Fronček (1989)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
A characterization of graphs in which some minimum dominating set covers all the edges
Bert L. Hartnell, Douglas F. Rall (1995)
Czechoslovak Mathematical Journal
Similarity: