This HTML5 document contains 40 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n10http://localhost/temp/predkladatel/
n6http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n13http://linked.opendata.cz/ontology/domain/vavai/
n15http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F49777513%3A23520%2F10%3A00504074%21RIV11-MSM-23520___/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n17http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F49777513%3A23520%2F10%3A00504074%21RIV11-MSM-23520___
rdf:type
n13:Vysledek skos:Concept
dcterms:description
This paper deals with the problem of labeling the vertices, edges and faces of a plane graph in such a way that the label of a face and the labels of the vertices and edges surrounding that face add up to a weight of that face, and the weights of all s-sided faces constitute an arithmetic progression of difference d, for each s that appears in the graph. The paper examines the existence of such labelings for disjoint union of plane graphs. This paper deals with the problem of labeling the vertices, edges and faces of a plane graph in such a way that the label of a face and the labels of the vertices and edges surrounding that face add up to a weight of that face, and the weights of all s-sided faces constitute an arithmetic progression of difference d, for each s that appears in the graph. The paper examines the existence of such labelings for disjoint union of plane graphs.
dcterms:title
Super d-antimagic labeling of disconnected plane graphs Super d-antimagic labeling of disconnected plane graphs
skos:prefLabel
Super d-antimagic labeling of disconnected plane graphs Super d-antimagic labeling of disconnected plane graphs
skos:notation
RIV/49777513:23520/10:00504074!RIV11-MSM-23520___
n3:aktivita
n12:I
n3:aktivity
I
n3:cisloPeriodika
12
n3:dodaniDat
n7:2011
n3:domaciTvurceVysledku
n6:5123917
n3:druhVysledku
n9:J
n3:duvernostUdaju
n16:S
n3:entitaPredkladatele
n15:predkladatel
n3:idSjednocenehoVysledku
291048
n3:idVysledku
RIV/49777513:23520/10:00504074
n3:jazykVysledku
n5:eng
n3:klicovaSlova
Graph; labelling; edge-antimagic; disconnected graphs
n3:klicoveSlovo
n8:Graph n8:labelling n8:edge-antimagic n8:disconnected%20graphs
n3:kodStatuVydavatele
DE - Spolková republika Německo
n3:kontrolniKodProRIV
[CE690EB4BD5B]
n3:nazevZdroje
Acta Mathematica Sinica, English Series
n3:obor
n17:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
4
n3:rokUplatneniVysledku
n7:2010
n3:svazekPeriodika
26
n3:tvurceVysledku
Phanalasy, Oudone Bača, Martin Semaničová-Feňovčíková, Andrea Miller, Mirka
s:issn
1439-8516
s:numberOfPages
12
n10:organizacniJednotka
23520