<?xml version="1.0"?>
<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:title xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">Orthogonal covers by multiplication graphs</dc:title>
  <dc:contributor xmlns:dc="http://purl.org/dc/elements/1.1/">Gronau, Hans-Dietrich , 1951- (VerfasserIn)</dc:contributor>
  <dc:contributor xmlns:dc="http://purl.org/dc/elements/1.1/">Schmidmeier, Markus , 1963- (VerfasserIn)</dc:contributor>
  <dc:type xmlns:dc="http://purl.org/dc/elements/1.1/">Text</dc:type>
  <dc:type xmlns:dc="http://purl.org/dc/elements/1.1/">Text</dc:type>
  <dc:date xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">2007</dc:date>
  <dc:date xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">2007</dc:date>
  
  <dc:language xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">eng</dc:language>
  <dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">electronic resource</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">remote</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">Computermedien</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">Online-Ressource</dc:format><dc:format xmlns:dc="http://purl.org/dc/elements/1.1/">1 Online-Ressource (15 Seiten)</dc:format>
  <dc:description xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">Let K be the complete oriented graph on the finite set of vertices A. A family G = {Ga : a ∈ A} of spanning subgraphs of K is an orthogonal cover provided every arrow of K occurs in exactly one Ga and for every two elements a, b ∈ A, the graphs Ga and Gopb have exactly one arrow in common. Gronau, Grüttmüller, Hartmann, Leck and Leck (2002) have observed that if A has the structure of a finite ring and if f ∈ A is such that both f + 1 and f − 1 are units, then the family, obtained by taking for G0 the multiplication graph of f and for Ga the rotation of G0 by a, defines an orthogonal cover on K. In this manuscript we assume that A is a finite abelian group and proceed to (i) generalize this construction to arbitrary endomorphisms of the underlying group and describe the possible graphs, (ii) introduce a duality on the set of orthogonal covers and (iii) give detailed descriptions of the covers in the case where A is cyclic or elementary abelian.&lt;eng&gt;</dc:description>
  <dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">Open Access</dc:rights>
  <dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">Urheberrechtsschutz 1.0</dc:rights>
  <dc:description xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">Hans-Dietrich O.F. Gronau and Markus Schmidmeier</dc:description>
  <dc:subject xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">510</dc:subject>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">https://purl.uni-rostock.de/rosdok/id00005832</dc:identifier>
  <dc:relation xmlns:dc="http://purl.org/dc/elements/1.1/">Orthogonal covers by multiplication graphs--(DE-627)526195088</dc:relation>
  
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">urn:nbn:de:gbv:28-rosdok_id00005832-5</dc:identifier>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">doi: 10.18453/rosdok_id00005832</dc:identifier>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:srw_dc="info:srw/schema/1/dc-schema">oclc: 1621468879</dc:identifier>
  <dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">ppn:
				(DE-627)198676804X</dc:identifier>
</oai_dc:dc>
