Displaying similar documents to “Edge Dominating Sets and Vertex Covers”

Maximal pentagonal packings.

Černý, A., Horák, P., Rosa, A., Znám, Š. (1996)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

On the Vertex Separation of Maximal Outerplanar Graphs

Markov, Minko (2008)

Serdica Journal of Computing

Similarity:

We investigate the NP-complete problem Vertex Separation (VS) on Maximal Outerplanar Graphs (mops). We formulate and prove a “main theorem for mops”, a necessary and sufficient condition for the vertex separation of a mop being k. The main theorem reduces the vertex separation of mops to a special kind of stretchability, one that we call affixability, of submops.

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...