For any hereditary graph class $\mathcal F$, we construct optimal adjacency labeling schemes for the classes of subgraphs and induced subgraphs of Cartesian products of graphs in $\mathcal F$. As a consequence, we show that, if $\mathcal F$ admits efficient adjacency labels (or, equivalently, small induced-universal graphs) meeting the information-theoretic minimum, then the classes of subgraphs and induced subgraphs of Cartesian products of graphs in $\mathcal F$ do too.
翻译:对于任何世系图形级的$\ mathcal F$,我们为Caltisian 产品的分类和诱导的分类图以$\mathcal F$计算,制定最佳的相邻标签办法。结果,我们表明,如果$\mathcal F$承认符合信息-理论最低要求的高效相邻标签(或等效的小型诱导通用图),那么用$\mathcal F$计算的Cartesian 产品的分类图和诱导的分类图也符合信息-理论最低要求,那么用$\mathcal F$计算。