PBIB Designs and Their Association Schemes Arising from Minimum Bi-Independent Dominating Sets of Circulant Graphs

DOI10.1007/978-981-16-1402-6_19zbMath1482.05250OpenAlexW3174858045MaRDI QIDQ5027628

S. A. Diwakar, B. Chaluvaraju

Publication date: 4 February 2022

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-16-1402-6_19

zbMATH Keywords

association schemescirculant graphPBIB designsbi-independent dominating sets

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph designs and isomorphic decomposition (05C51)

Cites Work

• PBIB-designs and association schemes arising from minimum bi-connected dominating sets of some special classes of graphs
• Partially balanced incomplete block designs arising from minimal dominating sets of a graph
• Towards a theory of domination in graphs
• Construction of Optimal Block Designs by Computer
• Domination Value in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: PBIB Designs and Their Association Schemes Arising from Minimum Bi-Independent Dominating Sets of Circulant Graphs