Silver block intersection graphs of Steiner 2-designs

DOI10.1007/S00373-012-1174-YzbMATH Open1268.05058arXiv1005.4492OpenAlexW2159732092MaRDI QIDQ354426FDOQ354426

Authors: Amin Ahadi, Nazli Besharati, E. S. Mahmoodian, M. Mortezaeefar 

Publication date: 19 July 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Abstract: For a block design $calD$, a series of {sf block intersection graphs} $G_i$, or $i$-{ m BIG}($calD$), $i=0,\mathrm{...},k$ is defined in which the vertices are the blocks of $calD$, with two vertices adjacent if and only if the corresponding blocks intersect in exactly $i$ elements. A silver graph $G$ is defined with respect to a maximum independent set of $G$, called a {sf diagonal} of that graph. Let $G$ be $r$-regular and $c$ be a proper $(r+1)$-coloring of $G$. A vertex $x$ in $G$ is said to be {sf rainbow} with respect to $c$ if every color appears in the closed neighborhood $N[x]=N(x)cupx$. Given a diagonal $I$ of $G$, a coloring $c$ is said to be silver with respect to $I$ if every $xinI$ is rainbow with respect to $c$. We say $G$ is {sf silver} if it admits a silver coloring with respect to some $I$. We investigate conditions for 0-{ m BIG}($calD$) and 1-{ m BIG}($calD$) of Steiner systems $calD=S(2,k,v)$ to be silver.

Full work available at URL: https://arxiv.org/abs/1005.4492

Recommendations

• The chromatic index of block intersection graphs of Kirkman triple systems and cyclic Steiner triple systems
• scientific article; zbMATH DE number 3890249
• Silver cubes
• Pancyclic BIBD block-intersection graphs
• Designs associated with maximum independent sets of a graph

zbMATH Keywords

Steiner triple systemblock intersection graphsilver coloringSteiner 2-design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Triple systems (05B07)

Cites Work

• A course in combinatorics.
• The CRC handbook of combinatorial designs
• Edge-pancyclic block-intersection graphs
• A survey on the distance-colouring of graphs
• Title not available (Why is that?)
• Silver cubes
• The connectivity of the block-intersection graphs of designs
• Cycles in the block-intersection graph of pairwise balanced designs
• Pancyclic BIBD block-intersection graphs
• Hamilton decompositions of block-intersection graphs of Steiner triple systems
• Title not available (Why is that?)
• Hamilton cycles in block-intersection graphs of triple systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The file distribution problem for processor networks
• Title not available (Why is that?)

Cited In (1)

• Mutual incidence matrix of two balanced incomplete block designs

This page was built for publication: Silver block intersection graphs of Steiner 2-designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354426)