Results 71 to 80 of about 30,352 (163)
Distinguishing Cartesian Products of Countable Graphs
Discussiones Mathematicae Graph Theory, 2017 The distinguishing number D(G) of a graph G is the minimum number of colors needed to color the vertices of G such that the coloring is preserved only by the trivial automorphism.
Estaji Ehsan +4 more
doaj +1 more source
Infinite Paths of Minimal Length on Suborbital Graphs for Some Fuchsian Groups
International Journal of Mathematics and Mathematical Sciences, 2019 In this study, we work on the Fuchsian group Hm where m is a prime number acting on mℚ^ transitively. We give necessary and sufficient conditions for two vertices to be adjacent in suborbital graphs induced by these groups.
Khuanchanok Chaichana, Pradthana Jaipong
doaj +1 more source
Prime, Composite and Fundamental Kirchhoff Graphs
A Kirchhoff graph is a vector graph with orthogonal cycles and vertex cuts. An algorithm has been developed that constructs all the Kirchhoff graphs up to a fixed edge multiplicity. This algorithm is used to explore the structure of prime Kirchhoff graph tilings.
Wang, Jessica, Fehribach, Joseph
openaire +2 more sources
On the relation between the non-commuting graph and the prime graph [PDF]
International Journal of Group Theory, 2012 Given a non-abelian finite group $G$, let $pi(G)$ denote the set of prime divisors of the order of $G$ and denote by $Z(G)$ the center of $G$. Thetextit{ prime graph} of $G$ is the graph with vertex set $pi(G)$ where two distinct primes $p$ and $q$ are ...
N. Ahanjideh, A. Iranmanesh
doaj
Presented in Computing Conference 2025 held at London, UK during June 19 - 20 ...
openaire +2 more sources
Relatively Prime Graph RPn [PDF]
International Journal of Engineering Science, Advanced Computing and Bio-Technology, 2018 U. Kumaran, K. Marimuthu
openaire +1 more source
PRIME LABELING IN DUPLICATE GRAPH OF SOME GRAPHS
, 2019 A graph with vertices is said to admit prime labeling if its vertices can be labeled with distinct positive integers not exceeding such that the labels of each pair of adjacent vertices are relatively prime. A graph which admits prime labeling is called a prime graph.
openaire +1 more source
The decomposition of complex networks into smaller, interconnected components is a central challenge in network theory with a wide range of potential applications. In this paper, we utilize tools from group theory and ring theory to study this problem when the network is a Cayley graph.
Chudnovsky, Maria +6 more
openaire +1 more source