About: Antimagic labeling of disjoint union of s-crowns

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Antimagic labeling of disjoint union of s-crowns 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)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	A graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijection f : of the set of vertices and edges onto {1, 2, ..., p + q} such that the edge-weights, w(uv) = f(u) + f(v) + f(uv) form an arithmetic sequence with first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. In this paper we study super (a,d)-edge-antimagic total properties of disconnected graphs consisting of s-crowns, paths and cycles. A graph G of order p and size q is called (a,d)-edge-antimagic total if there exists a bijection f : of the set of vertices and edges onto {1, 2, ..., p + q} such that the edge-weights, w(uv) = f(u) + f(v) + f(uv) form an arithmetic sequence with first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. In this paper we study super (a,d)-edge-antimagic total properties of disconnected graphs consisting of s-crowns, paths and cycles. (en)
Title	Antimagic labeling of disjoint union of s-crowns Antimagic labeling of disjoint union of s-crowns (en)
skos:prefLabel	Antimagic labeling of disjoint union of s-crowns Antimagic labeling of disjoint union of s-crowns (en)
skos:notation	RIV/49777513:23520/09:00503070!RIV10-MSM-23520___
http://linked.open...avai/riv/aktivita	S
http://linked.open...avai/riv/aktivity	S
http://linked.open...iv/cisloPeriodika	1
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Miller, Mirka
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Západočeská univerzita v Plzni / Fakulta aplikovaných věd
http://linked.open...dnocenehoVysledku	303483
http://linked.open...ai/riv/idVysledku	RIV/49777513:23520/09:00503070
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	(a,d)-edge-antimagic total labeling; super (a,d)-edge-anti-magic total labeling (en)
http://linked.open.../riv/klicoveSlovo	(a d)-edge-anti-magic total labeling d)-edge-antimagic total labeling super (a
http://linked.open...odStatuVydavatele	CA - Kanada
http://linked.open...ontrolniKodProRIV	[45FCADDC2978]
http://linked.open...i/riv/nazevZdroje	Utilitas Mathematica
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...UplatneniVysledku	2009
http://linked.open...v/svazekPeriodika	79
http://linked.open...iv/tvurceVysledku	Miller, Mirka Ryan, Joe Bača, Martin Dafik, D.
issn	0315-3681
number of pages	13 (xsd:int)
http://localhost/t...ganizacniJednotka	23520
is http://linked.open...avai/riv/vysledek of	Antimagic labeling of disjoint union of s-crowns Antimagic labeling of disjoint union of s-crowns Antimagic labeling of disjoint union of s-crowns Antimagic labeling of disjoint union of s-crowns

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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, 39 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software