About: Power digraphs modulo n are symmetric of order M in and only if M is square free

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

About: Power digraphs modulo n are symmetric of order M in and only if M is square free 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	We assign to each pair of positive integers k>=2 and n a digraph G(n,k) whose set of vertices is H = {0, 1, . . . , n 1} and for which there is a directed edge from a H to b H if ak = b (mod n). The digraph G(n, k) is symmetric of order M if its set of components can be partitioned into disjoint subsets, each containing exactly M isomorphic components. Deng and Yuan completely characterized all symmetric digraphs of order M when M = 2 or M is divisible by an odd prime. We demonstrate that their classification is complete by showing that there are no symmetric digraphs G(n, k) of order 2s for s >= 2. We assign to each pair of positive integers k>=2 and n a digraph G(n,k) whose set of vertices is H = {0, 1, . . . , n 1} and for which there is a directed edge from a H to b H if ak = b (mod n). The digraph G(n, k) is symmetric of order M if its set of components can be partitioned into disjoint subsets, each containing exactly M isomorphic components. Deng and Yuan completely characterized all symmetric digraphs of order M when M = 2 or M is divisible by an odd prime. We demonstrate that their classification is complete by showing that there are no symmetric digraphs G(n, k) of order 2s for s >= 2. (en)
Title	Power digraphs modulo n are symmetric of order M in and only if M is square free Power digraphs modulo n are symmetric of order M in and only if M is square free (en)
skos:prefLabel	Power digraphs modulo n are symmetric of order M in and only if M is square free Power digraphs modulo n are symmetric of order M in and only if M is square free (en)
skos:notation	RIV/67985840:_____/12:00380313!RIV13-AV0-67985840
http://linked.open...avai/riv/aktivita	I P
http://linked.open...avai/riv/aktivity	I, P(IAA100190803)
http://linked.open...iv/cisloPeriodika	3
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Křížek, Michal
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	Matematický ústav AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	160510
http://linked.open...ai/riv/idVysledku	RIV/67985840:_____/12:00380313
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	symmetric iteration digraphs (en)
http://linked.open.../riv/klicoveSlovo	symmetric iteration digraphs
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[54670BC91D70]
http://linked.open...i/riv/nazevZdroje	Fibonacci Quarterly
http://linked.open...in/vavai/riv/obor	BA
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	The finite element method for higher dimensional problems
http://linked.open...UplatneniVysledku	2012
http://linked.open...v/svazekPeriodika	50
http://linked.open...iv/tvurceVysledku	Křížek, Michal Somer, L.
issn	0015-0517
number of pages	11 (xsd:int)

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