Research article

Notes on the equitable graph of type II of a finite group

  • Published: 09 March 2026
  • Given a finite group $ G $, the equitable graph of type II defined on $ G $ is an undirected graph with vertex set $ G $, in which two distinct vertices $ a $ and $ b $ are adjacent if and only if either $ 0 < |o(a)-o(b)|\le \min\{o(a), o(b)\} $ or one of $ a $ and $ b $ is equal to $ e $, where $ o(a) $ and $ o(b) $ are the orders of $ a $ and $ b $, respectively. In this paper, we observe that every equitable graph of type II of a finite group is a generalized lexicographic product and discuss finite groups $ G $ whose equitable graph of type II is $ C_n $-free, where $ n\ge 3 $. As an application, we show that every equitable graph of type II of a finite group is perfect. Finally, we characterize the metric dimension of the equitable graph of type II of a finite group.

    Citation: Chunqiang Cui, Changliang Wang. Notes on the equitable graph of type II of a finite group[J]. Electronic Research Archive, 2026, 34(3): 2087-2098. doi: 10.3934/era.2026093

    Related Papers:

  • Given a finite group $ G $, the equitable graph of type II defined on $ G $ is an undirected graph with vertex set $ G $, in which two distinct vertices $ a $ and $ b $ are adjacent if and only if either $ 0 < |o(a)-o(b)|\le \min\{o(a), o(b)\} $ or one of $ a $ and $ b $ is equal to $ e $, where $ o(a) $ and $ o(b) $ are the orders of $ a $ and $ b $, respectively. In this paper, we observe that every equitable graph of type II of a finite group is a generalized lexicographic product and discuss finite groups $ G $ whose equitable graph of type II is $ C_n $-free, where $ n\ge 3 $. As an application, we show that every equitable graph of type II of a finite group is perfect. Finally, we characterize the metric dimension of the equitable graph of type II of a finite group.



    加载中


    [1] I. Beck, Coloring of commutative rings, J. Algebra, 116 (1988), 208–226. https://doi.org/10.1016/0021-8693(88)90202-5 doi: 10.1016/0021-8693(88)90202-5
    [2] A. V. Kelarev, J. Ryan, J. Yearwood, Cayley graphs as classifiers for data mining: The influence of asymmetries, Discrete Math., 309 (2009), 5360–5369. https://doi.org/10.1016/j.disc.2008.11.030 doi: 10.1016/j.disc.2008.11.030
    [3] R. Brauer, K. A. Fowler, On groups of even order, Ann. Math., 62 (1955), 565–583. https://doi.org/10.2307/1970080
    [4] A. V. Kelarev, S. J. Quinn, Directed graphs and combinatorial properties of semigroups, J. Algebra, 251 (2002), 16–26. https://doi.org/10.1006/jabr.2001.9128 doi: 10.1006/jabr.2001.9128
    [5] W. Shi, Quantitative characterization of finite simple groups: a complement, Int. J. Group Theory, 14 (2025), 181–222. https://dx.doi.org/10.22108/ijgt.2024.140804.1893 doi: 10.22108/ijgt.2024.140804.1893
    [6] A. Hamzeh, A. R. Ashrafi, Automorphism group of supergraphs of the power graph of a finite group, Eur. J. Combin., 60 (2017), 82–88. https://doi.org/10.1016/j.ejc.2016.09.005 doi: 10.1016/j.ejc.2016.09.005
    [7] J. Chen, J. Chen, S. Lin, Finite groups whose order graph is $C_4$-free, Proc. Est. Acad. Sci., 74 (2025), 514–520. https://doi.org/10.3176/proc.2025.4.04 doi: 10.3176/proc.2025.4.04
    [8] A. Altassan, A. Saleh, M. Hamed, N. Muthana, Characterizing finite groups through equitable graphs: a graph-theoretic approach, Mathematics, 12 (2024), 2126. https://doi.org/10.3390/math12132126 doi: 10.3390/math12132126
    [9] A. Altassan, A. Saleh, H. Alashwali, M. Hamed, N. Muthana, Equitable graphs of type II from groups: Studying and analyzing, Electron. Res. Arch., 33 (2025), 6805–6843. https://doi.org/10.3934/era.2025301 doi: 10.3934/era.2025301
    [10] F. Harary, R. A. Melter, On the metric dimension of a graph, Ars Comb., 2 (1976), 191–195.
    [11] P. J. Slater, Leaves of trees, Congr. Numer., 14 (1975), 549–559.
    [12] M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
    [13] X. Ma, R. Fu, Metric and strong metric dimension in intersection power graphs of finite groups, Commun. Algebra, 53 (2025), 1829–1840. https://doi.org/10.1080/00927872.2024.2423267 doi: 10.1080/00927872.2024.2423267
    [14] F. Bonomo-Braberman, G. Durán, M. D. Safe, A. K. Wagler, On some graph classes related to perfect graphs: A survey, Discrete Appl. Math., 281 (2020), 42–60. https://doi.org/10.1016/j.dam.2019.05.019 doi: 10.1016/j.dam.2019.05.019
    [15] D. Gorenstein, Finite Groups, Chelsea Publishing Co., New York, 1980.
    [16] G. Sabidussi, Graph derivates, Math. Z., 76 (1961), 385–401. https://doi.org/10.1007/BF01210984
    [17] M. Chudnovsky, N. Robertson, P. Seymour, R. Thomas, The strong perfect graph theorem, Ann. Math., 164 (2006), 51–229. https://doi.org/10.4007/annals.2006.164.51 doi: 10.4007/annals.2006.164.51
    [18] C. Hernando, M. Mora, I. M. Pelayo, C. Seara, D. R. Wood, Extremal graph theory for metric dimension and diameter, Electron. J. Comb., 17 (2010), #R30. https://doi.org/10.37236/302
    [19] G. Chartrand, L. Eroh, M. A. Johnson, O. R. Oellermann, Resolvability in graphs and the metric dimension of a graph, Discrete Appl. Math., 105 (2000), 99–113. https://doi.org/10.1016/S0166-218X(00)00198-0 doi: 10.1016/S0166-218X(00)00198-0
  • Reader Comments
  • © 2026 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(105) PDF downloads(9) Cited by(0)

Article outline

Figures and Tables

Figures(2)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog