About: A note on 4-regular distance magic graphs     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Let G = (V,E) be a graph on n vertices. A bijection f: V of {1, 2,..., n} is called a distance magic labeling of G if there exists an integer k such that suma uEN(υ) f(u) = k for all υ EV, where N(υ) is the set of all vertices adjacent to υ. The constant k is the magic constant of f and any graph which admits a distance magic labeling is a distance magic graph. In this paper we solve some of the problems posted in a recent survey paper on distance magic graph labelings by Arumugam et al. We classify all orders n for which a 4-regular distance magic graph exists and by this we also show that there exists a distance magic graph with k = 2t for every integer t more equal 6.
  • Let G = (V,E) be a graph on n vertices. A bijection f: V of {1, 2,..., n} is called a distance magic labeling of G if there exists an integer k such that suma uEN(υ) f(u) = k for all υ EV, where N(υ) is the set of all vertices adjacent to υ. The constant k is the magic constant of f and any graph which admits a distance magic labeling is a distance magic graph. In this paper we solve some of the problems posted in a recent survey paper on distance magic graph labelings by Arumugam et al. We classify all orders n for which a 4-regular distance magic graph exists and by this we also show that there exists a distance magic graph with k = 2t for every integer t more equal 6. (en)
Title
  • A note on 4-regular distance magic graphs
  • A note on 4-regular distance magic graphs (en)
skos:prefLabel
  • A note on 4-regular distance magic graphs
  • A note on 4-regular distance magic graphs (en)
skos:notation
  • RIV/61989100:27740/12:86084141!RIV13-MSM-27740___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(ED1.1.00/02.0070), S, Z(MSM6198910027)
http://linked.open...iv/cisloPeriodika
  • 2
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 120462
http://linked.open...ai/riv/idVysledku
  • RIV/61989100:27740/12:86084141
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • distance magic; Graph labeling (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • AU - Australské společenství
http://linked.open...ontrolniKodProRIV
  • [5D0A865DB125]
http://linked.open...i/riv/nazevZdroje
  • Australasian Journal of Combinatorics
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 54
http://linked.open...iv/tvurceVysledku
  • Fronček, Dalibor
  • Kovář, Petr
  • Kovářová, Tereza
http://linked.open...n/vavai/riv/zamer
issn
  • 1034-4942
number of pages
http://localhost/t...ganizacniJednotka
  • 27740
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software