About: A note on antimagic labelings of trees     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
  • In 1990, Hartsfield and Ringel conjectured %22Every tree except K2 is antimagic%22, where antimagic means that there is a bijection from E(G) to {1, 2, ... , |E(G)|} such that at each vertex the weight (sum of the labels of incident edges) is different. We call such a labeling a vertex antimagic edge labeling. As a step towards proving this conjecture, we provide a method whereby, given any degree sequence pertaining to a tree, we can construct an antimagic tree based on this sequence. Furthermore, swapping the roles of edges and vertices with respect to a labeling, we provide a method to construct an edge antimagic vertex labeling for any tree and we consider edge anti magic vertex labeling of graphs in general.
  • In 1990, Hartsfield and Ringel conjectured %22Every tree except K2 is antimagic%22, where antimagic means that there is a bijection from E(G) to {1, 2, ... , |E(G)|} such that at each vertex the weight (sum of the labels of incident edges) is different. We call such a labeling a vertex antimagic edge labeling. As a step towards proving this conjecture, we provide a method whereby, given any degree sequence pertaining to a tree, we can construct an antimagic tree based on this sequence. Furthermore, swapping the roles of edges and vertices with respect to a labeling, we provide a method to construct an edge antimagic vertex labeling for any tree and we consider edge anti magic vertex labeling of graphs in general. (en)
Title
  • A note on antimagic labelings of trees
  • A note on antimagic labelings of trees (en)
skos:prefLabel
  • A note on antimagic labelings of trees
  • A note on antimagic labelings of trees (en)
skos:notation
  • RIV/49777513:23520/14:43924759!RIV15-MSM-23520___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • I
http://linked.open...iv/cisloPeriodika
  • Neuveden
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
  • 971
http://linked.open...ai/riv/idVysledku
  • RIV/49777513:23520/14:43924759
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • tree; antimagic labeling (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • CA - Kanada
http://linked.open...ontrolniKodProRIV
  • [74E369C7CDDE]
http://linked.open...i/riv/nazevZdroje
  • Bulletin of the Institute of Combinatorics and its Applications
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 72
http://linked.open...iv/tvurceVysledku
  • Phanalasy, Oudone
  • Ryan, Joe
  • Rylands, Leanne
  • Miller, Miroslava
issn
  • 1183-1278
number of pages
http://localhost/t...ganizacniJednotka
  • 23520
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