当前位置: X-MOL 学术Arab. J. Math. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Equality of graphs up to complementation
Arabian Journal of Mathematics ( IF 0.9 ) Pub Date : 2020-11-02 , DOI: 10.1007/s40065-020-00297-8
Jamel Dammak , Gérard Lopez , Hamza Si Kaddour

We prove the following: Let G and \(G'\) be two graphs on the same set V of v vertices, and let k be an integer, \(4\le k\le v-4\). If for all k-element subsets K of V, the induced subgraphs \(G_{\restriction K}\) and \(G'_{\restriction K}\) have the same numbers of 3-homogeneous subsets, the same numbers of \(P_4\)’s, and the same numbers of claws or co-claws, then \(G'\) is equal to G or to the complement \(\overline{G}\) of G. We give also a similar result whenever the same numbers are modulo a prime.



中文翻译:

图的相等性直至补全

我们证明如下结果:设ģ\(G'\)是在同一组两个曲线图Vv顶点,并让ķ是整数,\(4 \文件ķ\文件V-4 \) 。如果对于所有ķ -元素子集ķV,感应子图\(G _ {\限制ķ} \)\(G'_ {\限制ķ} \)有3个均匀子集的相同的数字,相同的数的\(P_4 \)的,和爪或共爪的相同的数字,然后\(G'\)等于ģ或补体\({G} \ \划线)ģ。每当相同的数字以质数为模时,我们也会给出相似的结果。

更新日期:2020-11-02
down
wechat
bug