On the maximum number of non attacking rooks on a high-dimensional simplicial chessboard

01/31/2021
โˆ™
by   Arash Ahadi, et al.
โˆ™
0
โˆ™

The simplicial rook graph ๐’ฎโ„›(m,n) is the graph whose vertices are vectors in โ„•^m such that for each vector the summation of its coordinates is n and two vertices are adjacent if their corresponding vectors differ in exactly two coordinates. Martin and Wagner (Graphs Combin. (2015) 31:1589โ€“1611) asked about the independence number of ๐’ฎโ„›(m,n) that is the maximum number of non attacking rooks which can be placed on a (m-1)-dimensional simplicial chessboard of side length n+1. In this work, we solve this problem and show that ฮฑ(๐’ฎโ„›(m,n))=(1-o(1))n+m-1n/m. We also prove that for the domination number of rook graphs we have ฮณ(๐’ฎโ„›(m, n))= ฮ˜ (n^m-2). Moreover we show that these graphs are Hamiltonian. The cyclic simplicial rook graph ๐’ž๐’ฎโ„›(m,n) is the graph whose vertices are vectors in โ„ค^m_n such that for each vector the summation of its coordinates modulo n is 0 and two vertices are adjacent if their corresponding vectors differ in exactly two coordinates. In this work we determine several properties of these graphs such as independence number, chromatic number and automorphism group. Among other results, we also prove that computing the distance between two vertices of a given ๐’ž๐’ฎโ„›(m,n) is ๐๐-hard in terms of n and m.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
โˆ™ 04/29/2019

Reconfiguring colourings of graphs with bounded maximum average degree

The reconfiguration graph R_k(G) of the k-colourings of a graph G has as...
research
โˆ™ 01/30/2023

Cops and robbers on P_5-free graphs

We prove that every connected P_5-free graph has cop number at most two,...
research
โˆ™ 03/02/2018

Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiล„ski gasket

As a fundamental subject of theoretical computer science, the maximum in...
research
โˆ™ 11/27/2021

More relations between ฮป-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs

This paper deals with the ฮป-labeling and L(2,1)-coloring of simple graph...
research
โˆ™ 11/12/2019

Terrain Visibility Graphs and Cyclic Polytope Triangulations

We prove a bijection between the triangulations of the 3-dimensional cyc...
research
โˆ™ 09/20/2021

Network Clustering by Embedding of Attribute-augmented Graphs

In this paper we propose a new approach to detect clusters in undirected...
research
โˆ™ 12/31/2021

A phase transition for the probability of being a maximum among random vectors with general iid coordinates

Consider n iid real-valued random vectors of size k having iid coordinat...

Please sign up or login with your details

Forgot password? Click here to reset