Results 21 to 30 of about 5,539,148 (288)
The rainbow connection number of the enhanced power graph of a finite group
Electronic Journal of Graph Theory and Applications, 2023 Let G be a finite group. The enhanced power graph ΓGe of G is the graph with vertex set G and two distinct vertices are adjacent if they generate a cyclic subgroup of G. In this article, we calculate the rainbow connection number of ΓGe.
Luis A. Dupont +2 more
doaj +1 more source
Recent developments on the power graph of finite groups – a survey
AKCE International Journal of Graphs and Combinatorics, 2021 Algebraic graph theory is the study of the interplay between algebraic structures (both abstract as well as linear structures) and graph theory. Many concepts of abstract algebra have facilitated through the construction of graphs which are used as tools
Ajay Kumar +3 more
doaj +1 more source
The Wiener, hyper-Wiener, Harary and SK indices of the P(Z_{p^k.q^r}) power graph [PDF]
Notes on Number Theory and Discrete Mathematics, 2023 The undirected P(Zₙ) power graph of a finite group of Zₙ is a connected graph, the set of vertices of which is Zₙ. Here u,v∈P(Zₙ) are two diverse adjacent vertices if and only if u≠v and ⟨v⟩ ⊆ ⟨u⟩ or ⟨u⟩ ⊆ ⟨v⟩.
Volkan Aşkin
doaj +1 more source
The b-chromatic number of power graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 The b-chromatic number of a graph G is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i, with 1 ≤ i≤ k, has at least one representant x_i adjacent to a vertex of
Brice Effantin, Hamamache Kheddouci
doaj +1 more source
A graph rewriting programming language for graph drawing [PDF]
, 1998 This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
The H-Line Signed Graph of a Signed Graph [PDF]
, 2010 For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required.
Reddy, Siva Kota +2 more
core +1 more source
On the Regular Power Graph on the Conjugacy Classes of Finite Groups [PDF]
Mathematics Interdisciplinary Research, 2018 The (undirected) power graph on the conjugacy classes PC(G) of a group G is a simple graph in which the vertices are the conjugacy classes of G and two distinct vertices C and C' are adjacent in PC(G) if one is a subset of a power of the other.
Sajjad Mahmood Robati
doaj +1 more source
Theoretical Computer Science, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreas Brandstädt, Van Bang Le
openaire +4 more sources
Compact routing on the Internet AS-graph [PDF]
, 2011 Compact routing algorithms have been presented as candidates for scalable routing in the future Internet, achieving near-shortest path routing with considerably less forwarding state than the Border Gateway Protocol.
Stephen D. Strowes +5 more
core +1 more source
Classifying Higher Rank Toeplitz Operators. [PDF]
, 2007 To a higher rank directed graph (Λ, d), in the sense of Kumjian and Pask, 2000, one can associate natural noncommutative analytic Toeplitz algebras, both weakly closed and norm closed.
Power, S.C.
core +4 more sources