Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Commuting graph of a group action with few edges
Download
index.pdf
Date
2023-1-01
Author
Güloğlu, İsmail
Ercan, Gülin
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
125
views
50
downloads
Cite This
Let A be a group acting by automorphisms on the group G. The commuting graph (Formula presented.) of A-orbits of this action is the simple graph with vertex set (Formula presented.), the set of all A-orbits on (Formula presented.), where two distinct vertices xA and yA are joined by an edge if and only if there exist (Formula presented.) and (Formula presented.) such that (Formula presented.). The present paper characterizes the groups G for which (Formula presented.) is an (Formula presented.) -graph, that is, a connected graph which contains at most one vertex whose degree is not less than three.
Subject Keywords
Commuting graph
,
friendship graph
,
F-graph
,
group action
,
FINITE-GROUPS
,
-graph
,
Commuting graph
,
friendship graph
,
group action
URI
https://hdl.handle.net/11511/102746
Journal
Communications in Algebra
DOI
https://doi.org/10.1080/00927872.2023.2172180
Collections
Department of Mathematics, Article
Suggestions
OpenMETU
Core
Prime graphs of solvable groups
Ulvi , Muhammed İkbal; Ercan, Gülin; Department of Electrical and Electronics Engineering (2020-8)
If $G$ is a finite group, its prime graph $Gamma_G$ is constructed as follows: the vertices are the primes dividing the order of $G$, two vertices $p$ and $q$ are joined by an edge if and only if $G$ contains an element of order $pq$. This thesis is mainly a survey that gives some important results on the prime graphs of solvable groups by presenting their proofs in full detail.
Commuting graph of A-orbits
Gilloglu, Ismail S.; Ercan, Gülin (2021-05-01)
Let A be a finite group acting by automorphisms on the finite group G. We introduce the commuting graph Gamma(G, A) of this action and study some questions related to the structure of G under certain graph theoretical conditions on Gamma(G, A).
Non-simply connected Calabi-Yau threefolds constructed as quotients of Schoen threefolds
Karayayla, Tolga (2017-07-01)
The aim of this paper is to complete the classification of all Calabi-Yau threefolds which are constructed as the quotient of a smooth Schoen threefold X = B-1 x p1 B-2 (fiber product over P-1 of two relatively minimal rational elliptic surfaces B-1 and B-2 with section) under a finite group action acting freely on the Schoen threefold X. The abelian group actions on smooth Schoen threefolds which induce cyclic group actions on the base curve P-1 were studied by Bouchard and Donagi (2008), and all such acti...
A quadtree-based adaptively-refined cartesian-grid algorithm for solution of the euler equations
Bulkök, Murat; Aksel, Mehmet Haluk; Department of Mechanical Engineering (2005)
A Cartesian method for solution of the steady two-dimensional Euler equations is produced. Dynamic data structures are used and both geometric and solution-based adaptations are applied. Solution adaptation is achieved through solution-based gradient information. The finite volume method is used with cell-centered approach. The solution is converged to a steady state by means of an approximate Riemann solver. Local time step is used for convergence acceleration. A multistage time stepping scheme is used to ...
Existentially closed groups
Gürel, Yağmur; Kuzucuoğlu, Mahmut; Koçak Benli, Dilber; Department of Mathematics (2021-12-10)
A group G is called an Existentially Closed Group (Algebraically Closed Group) if for every finite system of equations and inequations with coefficients from G which has a solution in an over group H ≥ G, has a solution in G. Existentially closed groups were introduced by W. R. Scott in 1951. The notion of existentially closed groups is close to the notion of algebraically closed fields but there are substantial differences. Existentially closed groups were studied and advanced by B. H. Neumann. In this sur...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
İ. Güloğlu and G. Ercan, “Commuting graph of a group action with few edges,”
Communications in Algebra
, pp. 0–0, 2023, Accessed: 00, 2023. [Online]. Available: https://hdl.handle.net/11511/102746.