Results 31 to 40 of about 1,354 (80)
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
Distinguishing Cartesian Products of Countable Graphs
Discussiones Mathematicae Graph Theory, 2017 The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism.
Estaji Ehsan +4 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
The rigidity of a partially triangulated torus
Proceedings of the London Mathematical Society, Volume 118, Issue 5, Page 1277-1304, May 2019., 2019 Abstract A simple graph is 3‐rigid if its generic embeddings in R3 are infinitesimally rigid. Necessary and sufficient conditions are obtained for the minimal 3‐rigidity of a simple graph obtained from a triangulated torus by the deletion of edges interior to an embedded triangulated disc.
J. Cruickshank, D. Kitson, S. C. Power
wiley +1 more source
Rooted tree maps and the derivation relation for multiple zeta values
, 2017 Rooted tree maps assign to an element of the Connes-Kreimer Hopf algebra of rooted trees a linear map on the noncommutative polynomial algebra in two letters.
Bachmann, Henrik, Tanaka, Tatsushi
core +1 more source
2-closures of primitive permutation groups of holomorph type
Open Mathematics, 2019 The 2-closure G(2) of a permutation group G on a finite set Ω is the largest subgroup of Sym(Ω) which has the same orbits as G in the induced action on Ω × Ω.
Yu Xue, Pan Jiangmin
doaj +1 more source
Finite groups with star-free noncyclic graphs
Open Mathematics, 2019 For a finite noncyclic group G, let Cyc(G) be the set of elements a of G such that 〈a, b〉 is cyclic for each b of G. The noncyclic graph of G is a graph with the vertex set G ∖ Cyc(G), having an edge between two distinct vertices x and y if 〈x, y〉 is not
Ma Xuanlong, Walls Gary L., Wang Kaishun
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
Eccentric topological properties of a graph associated to a finite dimensional vector space
Main Group Metal Chemistry, 2020 A topological index is actually designed by transforming a chemical structure into a number. Topological index is a graph invariant which characterizes the topology of the graph and remains invariant under graph automorphism.
Liu Jia-Bao +5 more
doaj +1 more source
, 2011 We introduce a new Macaulay2 package, Nauty, which gives access to powerful methods on graphs provided by the software nauty by Brendan McKay. The primary motivation for accessing nauty is to determine if two graphs are isomorphic.
Cook II, David
core +1 more source