Results 1 to 10 of about 167 (114)
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
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
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
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
Finite groups whose intersection power graphs are toroidal and projective-planar
Open Mathematics, 2021 The intersection power graph of a finite group GG is the graph whose vertex set is GG, and two distinct vertices xx and yy are adjacent if either one of xx and yy is the identity element of GG, or ⟨x⟩∩⟨y⟩\langle x\rangle \cap \langle y\rangle is non ...
Li Huani, Ma Xuanlong, Fu Ruiqin
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 the sandpile model of modified wheels II
Open Mathematics, 2020 We investigate the abelian sandpile group on modified wheels Wˆn{\hat{W}}_{n} by using a variant of the dollar game as described in [N. L. Biggs, Chip-Firing and the critical group of a graph, J. Algebr. Comb. 9 (1999), 25–45].
Raza Zahid +3 more
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
The Planar Index and Outerplanar Index of Some Graphs Associated to Commutative Rings
Discussiones Mathematicae - General Algebra and Applications, 2019 In this paper, we study the planar and outerplanar indices of some graphs associated to a commutative ring. We give a full characterization of these graphs with respect to their planar and outerplanar indices when R is a finite ring.
Barati Zahra, Afkhami Mojgan
doaj +1 more source