Antibandwidth and cyclic antibandwidth of Hamming graphs

The antibandwidth problem is to label vertices of a graph G(V,E) bijectively by integers 0,1,…,|V|−1 in such a way that the minimal difference of labels of adjacent vertices is maximized. In this paper we study the antibandwidth of Hamming graphs. We provide labeling algorithms and tight upper bound...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics 2013-07, Vol.161 (10-11), p.1402-1408
Main Authors: Dobrev, Stefan, Královič, Rastislav, Pardubská, Dana, Török, L’ubomír, Vrt’o, Imrich
Format: Article
Language:English
Subjects:
Algorithms
Antibandwidth
Graphs
Hamming graph
Integers
Labels
Marking
Mathematical analysis
Reproduction
Upper bounds
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c373t-73d9c6fb73fe690af90ce543dbc79dd8f77d9d7b648c7201481a17fcdcb6d0973
cites cdi_FETCH-LOGICAL-c373t-73d9c6fb73fe690af90ce543dbc79dd8f77d9d7b648c7201481a17fcdcb6d0973
container_end_page 1408
container_issue 10-11
container_start_page 1402
container_title Discrete Applied Mathematics
container_volume 161
creator Dobrev, Stefan
Královič, Rastislav
Pardubská, Dana
Török, L’ubomír
Vrt’o, Imrich
description The antibandwidth problem is to label vertices of a graph G(V,E) bijectively by integers 0,1,…,|V|−1 in such a way that the minimal difference of labels of adjacent vertices is maximized. In this paper we study the antibandwidth of Hamming graphs. We provide labeling algorithms and tight upper bounds for general Hamming graphs Πk=1dKnk. We have exact values for special choices of ni′s and equality between antibandwidth and cyclic antibandwidth values. Moreover, in the case where the two largest sizes of ni′s are different we show that the Hamming graph is multiplicative in the sense of [9]. As a consequence, we obtain exact values for the antibandwidth of p isolated copies of this type of Hamming graphs.
doi_str_mv 10.1016/j.dam.2012.12.026
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1567066791</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0166218X13000152</els_id><sourcerecordid>1567066791</sourcerecordid><originalsourceid>FETCH-LOGICAL-c373t-73d9c6fb73fe690af90ce543dbc79dd8f77d9d7b648c7201481a17fcdcb6d0973</originalsourceid><addsrcrecordid>eNp9kE9LAzEQxYMoWKsfwNseveya7G4zCZ5KUSsUvCh4C9lJ0qbsn5pslX57U-rBkzAwD-a9YeZHyC2jBaOM328Lo7uipKwsUtGSn5EJE1DmHICdk0ny8Lxk4uOSXMW4pTQ5mZgQMe9H3-jefHszbrIkMjxg6zHJv4PBZUvddb5fZ-ugd5t4TS6cbqO9-e1T8v70-LZY5qvX55fFfJVjBdWYQ2UkctdA5SyXVDtJ0c7qyjQI0hjhAIw00PBaIKTza8E0A4cGG26ohGpK7k57d2H43Ns4qs5HtG2rezvso2IzDpRzkCxZ2cmKYYgxWKd2wXc6HBSj6khJbVWipI6UVKpEKWUeThmbfvjyNqiI3vZojQ8WR2UG_0_6B64Vb6M</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1567066791</pqid></control><display><type>article</type><title>Antibandwidth and cyclic antibandwidth of Hamming graphs</title><source>BACON - Elsevier - GLOBAL_SCIENCEDIRECT-OPENACCESS</source><source>ScienceDirect Freedom Collection</source><creator>Dobrev, Stefan ; Královič, Rastislav ; Pardubská, Dana ; Török, L’ubomír ; Vrt’o, Imrich</creator><creatorcontrib>Dobrev, Stefan ; Královič, Rastislav ; Pardubská, Dana ; Török, L’ubomír ; Vrt’o, Imrich</creatorcontrib><description>The antibandwidth problem is to label vertices of a graph G(V,E) bijectively by integers 0,1,…,|V|−1 in such a way that the minimal difference of labels of adjacent vertices is maximized. In this paper we study the antibandwidth of Hamming graphs. We provide labeling algorithms and tight upper bounds for general Hamming graphs Πk=1dKnk. We have exact values for special choices of ni′s and equality between antibandwidth and cyclic antibandwidth values. Moreover, in the case where the two largest sizes of ni′s are different we show that the Hamming graph is multiplicative in the sense of [9]. As a consequence, we obtain exact values for the antibandwidth of p isolated copies of this type of Hamming graphs.</description><identifier>ISSN: 0166-218X</identifier><identifier>EISSN: 1872-6771</identifier><identifier>DOI: 10.1016/j.dam.2012.12.026</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Algorithms ; Antibandwidth ; Graphs ; Hamming graph ; Integers ; Labels ; Marking ; Mathematical analysis ; Reproduction ; Upper bounds</subject><ispartof>Discrete Applied Mathematics, 2013-07, Vol.161 (10-11), p.1402-1408</ispartof><rights>2013 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c373t-73d9c6fb73fe690af90ce543dbc79dd8f77d9d7b648c7201481a17fcdcb6d0973</citedby><cites>FETCH-LOGICAL-c373t-73d9c6fb73fe690af90ce543dbc79dd8f77d9d7b648c7201481a17fcdcb6d0973</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>315,786,790,27957,27958</link.rule.ids></links><search><creatorcontrib>Dobrev, Stefan</creatorcontrib><creatorcontrib>Královič, Rastislav</creatorcontrib><creatorcontrib>Pardubská, Dana</creatorcontrib><creatorcontrib>Török, L’ubomír</creatorcontrib><creatorcontrib>Vrt’o, Imrich</creatorcontrib><title>Antibandwidth and cyclic antibandwidth of Hamming graphs</title><title>Discrete Applied Mathematics</title><description>The antibandwidth problem is to label vertices of a graph G(V,E) bijectively by integers 0,1,…,|V|−1 in such a way that the minimal difference of labels of adjacent vertices is maximized. In this paper we study the antibandwidth of Hamming graphs. We provide labeling algorithms and tight upper bounds for general Hamming graphs Πk=1dKnk. We have exact values for special choices of ni′s and equality between antibandwidth and cyclic antibandwidth values. Moreover, in the case where the two largest sizes of ni′s are different we show that the Hamming graph is multiplicative in the sense of [9]. As a consequence, we obtain exact values for the antibandwidth of p isolated copies of this type of Hamming graphs.</description><subject>Algorithms</subject><subject>Antibandwidth</subject><subject>Graphs</subject><subject>Hamming graph</subject><subject>Integers</subject><subject>Labels</subject><subject>Marking</subject><subject>Mathematical analysis</subject><subject>Reproduction</subject><subject>Upper bounds</subject><issn>0166-218X</issn><issn>1872-6771</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><recordid>eNp9kE9LAzEQxYMoWKsfwNseveya7G4zCZ5KUSsUvCh4C9lJ0qbsn5pslX57U-rBkzAwD-a9YeZHyC2jBaOM328Lo7uipKwsUtGSn5EJE1DmHICdk0ny8Lxk4uOSXMW4pTQ5mZgQMe9H3-jefHszbrIkMjxg6zHJv4PBZUvddb5fZ-ugd5t4TS6cbqO9-e1T8v70-LZY5qvX55fFfJVjBdWYQ2UkctdA5SyXVDtJ0c7qyjQI0hjhAIw00PBaIKTza8E0A4cGG26ohGpK7k57d2H43Ns4qs5HtG2rezvso2IzDpRzkCxZ2cmKYYgxWKd2wXc6HBSj6khJbVWipI6UVKpEKWUeThmbfvjyNqiI3vZojQ8WR2UG_0_6B64Vb6M</recordid><startdate>201307</startdate><enddate>201307</enddate><creator>Dobrev, Stefan</creator><creator>Královič, Rastislav</creator><creator>Pardubská, Dana</creator><creator>Török, L’ubomír</creator><creator>Vrt’o, Imrich</creator><general>Elsevier B.V</general><scope>6I.</scope><scope>AAFTH</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201307</creationdate><title>Antibandwidth and cyclic antibandwidth of Hamming graphs</title><author>Dobrev, Stefan ; Královič, Rastislav ; Pardubská, Dana ; Török, L’ubomír ; Vrt’o, Imrich</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c373t-73d9c6fb73fe690af90ce543dbc79dd8f77d9d7b648c7201481a17fcdcb6d0973</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Antibandwidth</topic><topic>Graphs</topic><topic>Hamming graph</topic><topic>Integers</topic><topic>Labels</topic><topic>Marking</topic><topic>Mathematical analysis</topic><topic>Reproduction</topic><topic>Upper bounds</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Dobrev, Stefan</creatorcontrib><creatorcontrib>Královič, Rastislav</creatorcontrib><creatorcontrib>Pardubská, Dana</creatorcontrib><creatorcontrib>Török, L’ubomír</creatorcontrib><creatorcontrib>Vrt’o, Imrich</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Discrete Applied Mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Dobrev, Stefan</au><au>Královič, Rastislav</au><au>Pardubská, Dana</au><au>Török, L’ubomír</au><au>Vrt’o, Imrich</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Antibandwidth and cyclic antibandwidth of Hamming graphs</atitle><jtitle>Discrete Applied Mathematics</jtitle><date>2013-07</date><risdate>2013</risdate><volume>161</volume><issue>10-11</issue><spage>1402</spage><epage>1408</epage><pages>1402-1408</pages><issn>0166-218X</issn><eissn>1872-6771</eissn><notes>ObjectType-Article-2</notes><notes>SourceType-Scholarly Journals-1</notes><notes>ObjectType-Feature-1</notes><notes>content type line 23</notes><abstract>The antibandwidth problem is to label vertices of a graph G(V,E) bijectively by integers 0,1,…,|V|−1 in such a way that the minimal difference of labels of adjacent vertices is maximized. In this paper we study the antibandwidth of Hamming graphs. We provide labeling algorithms and tight upper bounds for general Hamming graphs Πk=1dKnk. We have exact values for special choices of ni′s and equality between antibandwidth and cyclic antibandwidth values. Moreover, in the case where the two largest sizes of ni′s are different we show that the Hamming graph is multiplicative in the sense of [9]. As a consequence, we obtain exact values for the antibandwidth of p isolated copies of this type of Hamming graphs.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.dam.2012.12.026</doi><tpages>7</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0166-218X
ispartof Discrete Applied Mathematics, 2013-07, Vol.161 (10-11), p.1402-1408
issn 0166-218X
1872-6771
language eng
recordid cdi_proquest_miscellaneous_1567066791
source BACON - Elsevier - GLOBAL_SCIENCEDIRECT-OPENACCESS; ScienceDirect Freedom Collection
subjects Algorithms
Antibandwidth
Graphs
Hamming graph
Integers
Labels
Marking
Mathematical analysis
Reproduction
Upper bounds
title Antibandwidth and cyclic antibandwidth of Hamming graphs
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-09-23T06%3A39%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Antibandwidth%20and%20cyclic%20antibandwidth%20of%20Hamming%20graphs&rft.jtitle=Discrete%20Applied%20Mathematics&rft.au=Dobrev,%20Stefan&rft.date=2013-07&rft.volume=161&rft.issue=10-11&rft.spage=1402&rft.epage=1408&rft.pages=1402-1408&rft.issn=0166-218X&rft.eissn=1872-6771&rft_id=info:doi/10.1016/j.dam.2012.12.026&rft_dat=%3Cproquest_cross%3E1567066791%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c373t-73d9c6fb73fe690af90ce543dbc79dd8f77d9d7b648c7201481a17fcdcb6d0973%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1567066791&rft_id=info:pmid/&rfr_iscdi=true