Results 21 to 30 of about 1,036,687 (287)
Relatively Prime Detour Domination Number of Some Switching Graphs
Ratio Mathematica, 2023 In this paper, we introduce the concept of relatively prime detour domination number for switching graph. If a set S ⊆ V is a detour set, a dominating set with at least two elements, and has (deg(u), deg(v)) = 1 for each pair of vertices u and v, then it
C Jayasekaran, L. G. Binoja
doaj +1 more source
Characterization of some alternating groups by order and largest element order [PDF]
AUT Journal of Mathematics and Computing, 2022 The prime graph (or Gruenberg-Kegel graph) of a finite group is a well-known graph. In this paper, first, we investigate the structure of the finite groups with a non-complete prime graph.
Ali Mahmoudifar, Ayoub Gharibkhajeh
doaj +1 more source
Prime power and prime product distance graphs [PDF]
Discrete Applied Mathematics, 2019 A graph $G$ is a $k$-prime product distance graph if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of their labels is the product of at most $k$ primes. A graph has prime product number $ppn(G)=k$ if it is a $k$-prime product graph but not a $(k-1)$-prime product graph.
Yumi Kaneda +3 more
openaire +4 more sources
Ratio Mathematica, 2023 For a graph G, a bijection f is called an odd prime labeling , if f from V to f1; 3; 5; ::::; 2jV j - 1g for each edge uv in G the greatest common divisor of the labels of end vertices (f(u); f(v)) is one.
Meena S, Gajalakshmiy G
doaj +1 more source
ON THE PRIME GRAPH OF SIMPLE GROUPS [PDF]
Bulletin of the Australian Mathematical Society, 2014 AbstractLet $G$ be a finite group, let ${\it\pi}(G)$ be the set of prime divisors of $|G|$ and let ${\rm\Gamma}(G)$ be the prime graph of $G$. This graph has vertex set ${\it\pi}(G)$, and two vertices $r$ and $s$ are adjacent if and only if $G$ contains an element of order $rs$.
Burness, Tim C, Covato, Elisa
openaire +3 more sources
Relatively Prime Inverse Domination On Line Graph [PDF]
, 2023 Let G be non-trivial graph. A subset D of the vertex set V (G) of a graph G is called a dominating set of G if every vertex in V − D is adjacent to a vertex in D.
Jayasekaran, C. +3 more
core +1 more source
Discrete Mathematics, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Minimal unavoidable sets of cycles in plane graphs [PDF]
Opuscula Mathematica, 2018 A set \(S\) of cycles is minimal unavoidable in a graph family \(\cal{G}\) if each graph \(G \in \cal{G}\) contains a cycle from \(S\) and, for each proper subset \(S^{\prime}\subset S\), there exists an infinite subfamily \(\cal{G}^{\prime}\subseteq\cal{
Tomáš Madaras, Martina Tamášová
doaj +1 more source
On certain prime cordial families of graphs
Journal of Taibah University for Science, 2020 Graph labelling is an important tool in modelling real life problems. In the present paper, different graph families are studied for prime cordial labelling.
Nazeran Idrees +3 more
doaj +1 more source
On the composition factors of a group with the same prime graph as $B_{n}(5)$ [PDF]
, 2009 summary:Let $G$ be a finite group. The prime graph of $G$ is a graph whose vertex set is the set of prime divisors of $|G|$ and two distinct primes $p$ and $q$ are joined by an edge, whenever $G$ contains an element of order $pq$.
Babai, Azam +4 more
core +1 more source