Results 31 to 40 of about 2,362 (196)
Bilangan Kromatik Grap Commuting dan Non Commuting Grup Dihedral
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2015 Commuting graph is a graph that has a set of points X and two different vertices to be connected directly if each commutative in G. Let G non abelian group and Z(G) is a center of G.
Handrini Rahayuningtyas +2 more
doaj +1 more source
Commutativity of the adjacency matrices of graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saieed Akbari +2 more
openaire +2 more sources
Discrete Mathematics, 1989 Let G be a group, S a subset of G and C(G,S) the (commutator) graph with vertex set S and x adjacent to y if \(xy=yx\). The author proves: There is a sequence of groups G(n) of order \(6^ n\) such that every graph with n vertices is isomorphic to C(G(n),S(n)) for some subset S(n) (depending on the graph) with n elements of G(n).
openaire +1 more source
On the Existence of $f$-local Subgroups in a Group with Finite Involution
Известия Иркутского государственного университета: Серия "Математика", 2022 An $f$-local subgroup of an infinite group is each its infinite subgroup with a nontrivial locally finite radical. An involution is said to be finite in a group if it generates a finite subgroup with each conjugate involution.
A.I. Sozutov, M. V. Yanchenko
doaj +1 more source
Commute Times in Dense Graphs [PDF]
, 2016 In this paper, we introduce the approach of graph densification as a means of preconditioning spectral clustering. After motivating the need of densification, we review the fundamentals of graph densifiers based on cut similarity and then analyze their associated optimization problems.
Francisco Escolano +2 more
openaire +2 more sources
A Note on Commuting Graphs for Symmetric Groups [PDF]
The Electronic Journal of Combinatorics, 2009 The commuting graph ${\cal C}(G,X)$, where $G$ is a group and $X$ a subset of $G$, has $X$ as its vertex set with two distinct elements of $X$ joined by an edge when they commute in $G$. Here the diameter and disc structure of ${\cal C}(G,X)$ is investigated when $G$ is the symmetric group and $X$ a conjugacy class of $G$.
Chris J. Bates +3 more
openaire +3 more sources
Hosoya properties of the commuting graph associated with the group of symmetries
Main Group Metal Chemistry, 2021 A vast amount of information about distance based graph invariants is contained in the Hosoya polynomial. Such an information is helpful to determine well-known distance based molecular descriptors.
Abbas Ghulam +4 more
doaj +1 more source
Urban Expressway Renewal Strategy Based on Knowledge Graphs
Applied Sciences, 2023 As an important element of urban infrastructure renewal, urban expressway renewal is of great significance to improve the commuting efficiency of cities (especially metropolitan cities), strengthen the service capacity of urban road facilities, and ...
Min Zhu, Wenbo Zhou, Tengfei Yuan
doaj +1 more source
The connectivity of commuting graphs
Journal of Combinatorial Theory, Series A, 2006 The author determines a necessary and sufficient condition for the connectivity of commuting graphs \(C(G,X)\), where \(G\) is the symmetric group of degree \(n\) and \(X\) is any \(G\)-conjugacy class.
openaire +1 more source
The Clean Graph Of A Commutative Ring. [PDF]
Ars Comb., 2017 To gain a better understanding of clean rings and their relatives, the clean graph of a commutative ring with identity is introduced and its various properties established. Further investigation of clean graphs leads to additional results concerning other classes of rings.
Petrović, Zoran Z., Pucanović, Zoran
openaire