Results 11 to 20 of about 1,814,953 (245)
Graph products of groups [PDF]
, 1990 In the 1970's Baudisch introduced the idea of the semifree group, that is, a group in which the only relators are commutators of generators. Baudisch was mainly concerned with subgroup problems, employing length arguments on the elements of these groups.
Green, Elisabeth Ruth
core +7 more sources
Commuting conjugacy classes graph of the generalized dihedral and dicyclic groups [PDF]
ریاضی و جامعه, 2023 Suppose $G$ is a finite non-abelian group and $\Gamma(G)$ is a simple graph with the non-central conjugacy classes of $G$ as its vertex set. Two different non-central conjugacy classes $A$ and $B$ are assumed to be adjacent if and only if there are ...
Mohammadali Salahshour
doaj +1 more source
Discrete Applied Mathematics, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christophe Crespelle, Petr A. Golovach
openaire +4 more sources
Anti-Path Cover on Sparse Graph Classes [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We show that it is possible to use Bondy-Chvatal closure to design an FPT algorithm that decides whether or not it is possible to cover vertices of an input graph by at most k vertex disjoint paths in the complement of the input graph. More precisely, we
Pavel Dvořák +2 more
doaj +1 more source
Graph automorphisms for compression
Open Computer Science, 2020 Detecting automorphisms is a natural way to identify redundant information presented in structured data. When such redundancies are detected they can be used for data compression.
Čibej Uroš, Mihelič Jurij
doaj +1 more source
Tropical Graph Parameters [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Connection matrices for graph parameters with values in a field have been introduced by M. Freedman, L. Lovász and A. Schrijver (2007). Graph parameters with connection matrices of finite rank can be computed in polynomial time on graph classes of ...
Nadia Labai, Johann Makowsky
doaj +1 more source
Commuting Conjugacy Class Graph of G when G / Z(G)~=D2n [PDF]
Mathematics Interdisciplinary Research, 2020 Suppose G is a finite non-abelian group and Γ(G) is a simple graph with the non-central conjugacy classes of G as its vertex set. Two different noncentral conjugacy classes C and B are assumed to be adjacent in Γ(G) if and only if there are elements a ...
Mohammad Ali Salahshour
doaj +1 more source
Decomposition of class II graphs into two class I graphs
Discrete Mathematics, 2023 Mkrtchyan and Steffen [J. Graph Theory, 70 (4), 473--482, 2012] showed that every class II simple graph can be decomposed into a maximum $Δ$-edge-colorable subgraph and a matching. They further conjectured that every graph $G$ with chromatic index $Δ(G)+k$ ($k\geq 1$) can be decomposed into a maximum $Δ(G)$-edge-colorable subgraph (not necessarily ...
Yan Cao 0001 +5 more
openaire +4 more sources
Long-Tailed Graph Representation Learning via Dual Cost-Sensitive Graph Convolutional Network
Remote Sensing, 2022 Deep learning algorithms have seen a massive rise in popularity for remote sensing over the past few years. Recently, studies on applying deep learning techniques to graph data in remote sensing (e.g., public transport networks) have been conducted.
Yijun Duan +6 more
doaj +1 more source
A Class of semisymmetric graphs
Ars Mathematica Contemporanea, 2013 A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. Let p be a prime. In this paper, a class of semisymmetric graphs of order 2 p 3 are determined.
Du, Shao Fei, Li, Xuewen, Wang, Li
openaire +3 more sources