Results 51 to 60 of about 30,352 (163)

On Order Prime Divisor Graphs of Finite Groups

Discussiones Mathematicae - General Algebra and Applications, 2021
The order prime divisor graph 𝒫𝒟(G) of a finite group G is a simple graph whose vertex set is G and two vertices a, b ∈ G are adjacent if and only if either ab = e or o(ab) is some prime number, where e is the identity element of the group G and o(x ...
Sen Mridul K., Maity Sunil K., Das Sumanta   +2 more
doaj   +1 more source

Capturing Polynomial Time using Modular Decomposition [PDF]

Logical Methods in Computer Science, 2019
The question of whether there is a logic that captures polynomial time is one of the main open problems in descriptive complexity theory and database theory.
Berit Grußien
doaj   +1 more source

Forbidden subgraphs of Co-prime graphs of finite groups [PDF]

Transactions on Combinatorics
For a finite group $G$ the co-prime graph $\Gamma(G)$ is defined as a graph with vertex set $G$ in which two distinct vertices $x$ and $y$ are adjacent if and only if $gcd(o(x),o(y))=1$ where $o(x)$ and $o(y)$ denote the orders of the elements $x$ and $y$
Swathi V V, M. S. Sunitha
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, Sumiya Nasir, Fozia Bashir Farooq, Maria Majeed   +3 more
doaj   +1 more source

Graph coloring using commuting order product prime graph

Journal of Mathematics and Computer Science, 2020
The concept of graph coloring has become a very active field of research that enhances many practical applications and theoretical challenges. Various methods have been applied in carrying out this study. Let G be a finite group. In this paper, we introduce a new graph of groups, which is a commuting order product prime graph of finite groups as a ...
Bello, Muhammed, Mohd. Ali, Nor Muhainiah, Isah, Surajo Ibrahim   +2 more
openaire   +3 more sources

Prime vertex-minors of a prime graph

European Journal of Combinatorics
33 pages, 11 figures.
Kim, Donggyu, Oum, Sang-il
openaire   +2 more sources

Cartesian product of hypergraphs: properties and algorithms [PDF]

Electronic Proceedings in Theoretical Computer Science, 2009
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to decrease the algorithmic complexity of problems by using the factorization of the product.
Alain Bretto, Yannick Silvestre, Thierry Vallée   +2 more
doaj   +1 more source

ON SD-PRIME CORDIAL GRAPHS [PDF]

International Journal of Pure and Apllied Mathematics, 2016
Let G = (V (G),E(G)) be a simple, finite and undirected graph of order n. Given a bijection f : V (G) → {1,...,n}, we associate 2 integers S = f(u) + f(v) and D = |f(u) − f(v)| with every edge uv in E(G). The labeling f induces an edge labeling f ' : E(G) → {0,1} such that for any edge uv in E(G), f ' (uv) = 1 if gcd(S,D) = 1, and f ' (uv) = 0 ...
G.-C. Lau, H.-H. Chu, N. Suhadak, F.-Y. Foo, H.-K. Ng   +4 more
openaire   +1 more source

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

Recognition of prime graphs from a prime subgraph

Discrete Mathematics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ille, P., Villemaire, R.
openaire   +3 more sources