European Journal of Combinatorics (2017). [3] On locally primitive Cayley graphs of finite simple groups. Journal of Combinatorial Theory Series A (2011). Back to "Group Theory and Generalisations" ...

Journal of Pure and Applied Algebra (2020). [3] Groups whose degree graph has three independent vertices. Journal of Algebra (2018). [4] Groups whose character degree graph has diameter three.

Cubic graphs – those regular graphs in which every vertex has degree three – remain a fertile area of research in both combinatorics and theoretical computer science.

Journal of Computer and System Sciences (2021). [3] An embedding-based distance for temporal graphs. Nature Communications (2024). Back to "Graph, Social and Multimedia Data" ...

Applied Mathematics and Computation (2023). [2] Triangle-free intersection graphs of line segments with large chromatic number. Journal of Combinatorial Theory Series B (2014).

[2] Laplacian Spectrum of Non-Commuting Graphs of Finite Groups. Indian Journal of Pure and Applied Mathematics (2018). [3] The Diameter of the Commuting Graph of a Finite Group with Trivial Centre.

[3] On perfect codes in Cartesian products of graphs. European Journal of Combinatorics (2011). [4] Kernels and p-Kernels of pr-ary 1-Perfect Codes. Designs, Codes and Cryptography (2005).

Graphs and Combinatorics (2019). [3] Correspondence Colouring and its Application to List-Colouring Planar Graphs without Cycles of Lengths 4 to 8. Journal of Combinatorial Theory Series B (2018).

Character degree graphs constitute a powerful tool in the study of finite groups, encapsulating the interplay between group representation theory and graph theory.