Results 1 to 10 of about 1,383 (108)
Determining Number of Kneser Graphs: Exact Values and Improved Bounds [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 The determining number of a graph $G = (V,E)$ is the minimum cardinality of a set $S\subseteq V$ such that pointwise stabilizer of $S$ under the action of $Aut(G)$ is trivial.
Angsuman Das, Hiranya Kishore Dey
doaj +1 more source
Finite groups with 4p2q elements of maximal order
Open Mathematics, 2021 It is an interesting and difficult topic to determine the structure of a finite group by the number of elements of maximal order. This topic is related to Thompson’s conjecture, that is, if two finite groups have the same order type and one of them is ...
Tan Sanbiao, Chen Guiyun, Yan Yanxiong
doaj +1 more source
On Semisymmetric Cubic Graphs of Order 20p2, p Prime
Discussiones Mathematicae Graph Theory, 2021 A simple graph is called semisymmetric if it is regular and edge-transitive but not vertex-transitive. Let p be an arbitrary prime. Folkman proved [Regular line-symmetric graphs, J. Combin. Theory 3 (1967) 215–232] that there is no semisymmetric graph of
Shahsavaran Mohsen +1 more
doaj +1 more source
Burnside Chromatic Polynomials of Group-Invariant Graphs
Discussiones Mathematicae Graph Theory, 2023 We introduce the Burnside chromatic polynomial of a graph that is invariant under a group action. This is a generalization of the Q-chromatic function Zaslavsky introduced for gain graphs.
White Jacob A.
doaj +1 more source
Laplacian spectrum of comaximal graph of the ring ℤn
Special Matrices, 2022 In this paper, we study the interplay between the structural and spectral properties of the comaximal graph Γ(Zn)\Gamma \left({{\mathbb{Z}}}_{n}) of the ring Zn{{\mathbb{Z}}}_{n} for n>2n\gt 2.
Banerjee Subarsha
doaj +1 more source
The structure fault tolerance of burnt pancake networks
Open Mathematics, 2023 One of the symbolic parameters to measure the fault tolerance of a network is its connectivity. The HH-structure connectivity and HH-substructure connectivity extend the classical connectivity and are more practical.
Ge Huifen, Ye Chengfu, Zhang Shumin
doaj +1 more source
Commuting involution graphs for [(A)\tilde]n [PDF]
, 2006 In this article we consider the commuting graphs of involution conjugacy classes in the affine Weyl group A~n. We show that where the graph is connected the diameter is at most 6.
Hart, Sarah
core +1 more source
On cospectrality of gain graphs
Special Matrices, 2022 We define GG-cospectrality of two GG-gain graphs (Γ,ψ)\left(\Gamma ,\psi ) and (Γ′,ψ′)\left(\Gamma ^{\prime} ,\psi ^{\prime} ), proving that it is a switching isomorphism invariant.
Cavaleri Matteo, Donno Alfredo
doaj +1 more source
Surface Embeddability of Graphs via Joint Trees [PDF]
, 2011 This paper provides a way to observe embedings of a graph on surfaces based on join trees and then characterizations of orientable and nonorientable embeddabilities of a graph with given ...
Liu, Yanpei
core +1 more source
Path homology theory of edge-colored graphs
Open Mathematics, 2021 In this paper, we introduce the category and the homotopy category of edge-colored digraphs and construct the functorial homology theory on the foundation of the path homology theory provided by Grigoryan, Muranov, and Shing-Tung Yau.
Muranov Yuri V., Szczepkowska Anna
doaj +1 more source