Results 11 to 20 of about 5,539,148 (288)
Descending endomorphism graphs of groups
AKCE International Journal of Graphs and Combinatorics, 2023 We define a new type of graph of a group with reference to the descending endomorphisms of the group. A descending endomorphism of a group is an endomorphism that induces a corresponding endomorphism in every homomorphic image of the group. We define the
Vinay Madhusudanan +2 more
doaj +1 more source
Dilation theory for rank two graph algebras. [PDF]
, 2010 An analysis is given of $*$-representations of rank 2 single vertex graphs. We develop dilation theory for the non-selfadjoint algebras $\A_\theta$ and $\A_u$ which are associated with the commutation relation permutation $\theta$ of a 2-graph and, more ...
Yang, Dilian +2 more
core +4 more sources
The First Zagreb Index, The Wiener Index, and The Gutman Index of The Power of Dihedral Group
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Research on graphs combined with groups is an interesting topic in the field of combinatoric algebra where graphs are used to represent a group. One type of graph representation of a group is a power graph.
Evi Yuniartika Asmarani +5 more
doaj +1 more source
Network partitioning techniques based on network natural properties for power system application [PDF]
, 2002 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University, 10/04/2002.In this thesis, the problem of partitioning a network into interconnected sub-networks is addressed. The goal is to achieve a partitioning which
Alkhelaiwi, Ali Mani Turki
core +7 more sources
Power Graphs Defined on Non-Commutative Non-Associative Moufang Loops [PDF]
Advances in Group Theory and Applications, 2023 For a non-abelian group G of order n and for an odd prime p we present the non-commutative non-associative Moufang loop M = Mpn(G, p) of order pn. We name this loop the generalized Chein loop in celebrating the Chein loop defined in 1974 by Orin Chein ...
Fatemeh Samnia, Yadollah Marefat
doaj +1 more source
Graph Powers and Graph Homomorphisms [PDF]
The Electronic Journal of Combinatorics, 2010 In this paper, we investigate some basic properties of fractional powers. In this regard, we show that for any non-bipartite graph $G$ and positive rational numbers ${2r+1\over 2s+1} < {2p+1\over 2q+1}$, we have $G^{2r+1\over 2s+1} < G^{2p+1\over 2q+1}$. Next, we study the power thickness of $G$, that is, the supremum of rational numbers ${2r+
Hossein Hajiabolhassan, Ali Taherkhani
openaire +3 more sources
THE POWER GRAPH REPRESENTATION FOR INTEGER MODULO GROUP WITH POWER PRIME ORDER
Barekeng, 2023 There are many applications of graphs in various fields. Starting from chemical problems, such as the molecular shape of a compound to internet network problems, we can also use graphs to depict the abstract concept of a mathematical structure..
Lalu Riski Wirendra Putra +4 more
doaj +1 more source
Permutational Powers of a Graph [PDF]
The Electronic Journal of Combinatorics, 2019 This paper introduces a new graph construction, the permutational power of a graph, whose adjacency matrix is obtained by the composition of a permutation matrix with the adjacency matrix of the graph. It is shown that this construction recovers the classical zig-zag product of graphs when the permutation is an involution, and it is in fact more ...
Matteo Cavaleri +2 more
openaire +3 more sources
Forbidden Subgraphs of Power Graphs [PDF]
The Electronic Journal of Combinatorics, 2021 The undirected power graph (or simply power graph) of a group $G$, denoted by $P(G)$, is a graph whose vertices are the elements of the group $G$, in which two vertices $u$ and $v$ are connected by an edge between if and only if either $u=v^i$ or $v=u^j$ for some $i$, $j$.
Pallabi Manna +2 more
openaire +6 more sources
Clustering Powers of Sparse Graphs [PDF]
The Electronic Journal of Combinatorics, 2020 We prove that if $G$ is a sparse graph — it belongs to a fixed class of bounded expansion $\mathcal{C}$ — and $d\in \mathbb{N}$ is fixed, then the $d$th power of $G$ can be partitioned into cliques so that contracting each of these clique to a single vertex again yields a sparse graph.
Nešetřil, Jaroslav +3 more
openaire +5 more sources