M
Mirka Miller
Researcher at University of Minnesota
Publications - 7
Citations - 31
Mirka Miller is an academic researcher from University of Minnesota. The author has contributed to research in topics: 1-planar graph & Bound graph. The author has an hindex of 3, co-authored 7 publications receiving 29 citations.
Papers
More filters
The sum number of the cocktail party graph
TL;DR: In this paper, the complete n-partite graph G = H m;n was considered and an optimal labeling of the vertices of G by distinct positive integers was given, where the vertex u and v are adjacent if and only if there exists a vertex u + v. This was the first known graph with this property.
Antimagic labeling of the union of stars.
TL;DR: This paper considers super (a, d)edge-antimagic total labelings applied to the disjoint union of two stars K1,m and K2,n, a graph of order p and size q.
Journal ArticleDOI
Some open problems on graph labelings
TL;DR: In this note, some of the open problems on various aspects of graph labelings which were posed by the participants during IWOGL 2009 and which have not been included in any of the other papers appearing in this volume are presented.
The sum number of a disjoint union of graphs
TL;DR: In this paper, the authors considered the disjoint union of graphs as sum graphs and provided an upper bound on the sum number of such graphs and an application for the exclusive sum number.
MaxDDBS problem on butterfly networks.
TL;DR: This paper investigates the MaxDDBS problem when the host graph is a butterfly network and gives constructive lower bounds for subgraphs of maximum degree 4, 3 and 2.