On regular handicap graphs of order $n \equiv 0$ mod 8

On regular handicap graphs of order $n \equiv 0$ mod 8

A handicap distance antimagic labeling of a graph G = (V, E) with n vertices is a bijection f̂ : V → {1, 2, ..., n} with the property that f̂(xi) = i, the weight w(xi) is the sum of labels of all neighbors of xi, and the sequence of the weights w(x1), w(x2), ..., w(xn) forms an increasing arithmetic...

Full description

Saved in:
Bibliographic Details
Main Authors: Froncek, Dalibor; Department of Mathematics and Statistics, University of Minnesota Duluth Duluth, USA (Author), Shepanik, Aaron; Department of Mathematics and Statistics, University of Minnesota Duluth Duluth, USA (Author)
Format: EJournal Article
Published: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2018-10-10.
Subjects:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

Get Fulltext

3rd Floor Main Library

Holdings details from 3rd Floor Main Library
Call Number: A1234.567
Copy 1 Available

Similar Items