On the independence graph of Hamming graph

MaRDI QIDQ6981153zbMATH OpenFDO

Authors M. Saravanan, Km. Kathiresan

Publication date 21 May 2025

Published in Iranian Journal of Mathematical Sciences and Informatics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

zbMATH Keywords

Cartesian productHamming graphindependence graphindependent setrook problem

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites work

• Applications of product colouring
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• scientific article; zbMATH DE number 2192179 (Why is no real title available?)
• Independence ratios of graph powers
• Notes on the independence number in the Cartesian product of graphs
• On the bounds for the ultimate independence ratio of a graph
• On the independence graph of a graph
• On the number of maximum independent sets of graphs
• Rook numbers and the normal ordering problem
• Rook polynomials in three and higher dimensions
• The number of maximum independent sets in graphs
• The problem of the rooks and its applications
• The rook problem on saw-toothed chessboards

This page was built for publication: On the independence graph of Hamming graph

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