Results 41 to 50 of about 2,976 (243)
ON FINITE PRIME DISTANCE GRAPHS
Indian Journal of Pure and Applied Mathematics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Parthiban, A. +2 more
openaire +2 more sources
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]
, 2012 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, Khosravi, Behrooz
core +1 more source
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
A new characterization of some characteristically simple groups [PDF]
AUT Journal of Mathematics and Computing, 2023 Let $G$ be a finite group and $\mathrm{cd}(G)$ be the set of irreducible complex character degrees of $G$. It was proved that some finite simple groups are uniquely determined by their orders and their degree graphs.
Zohreh Sayanjali
doaj +1 more source
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. +2 more
doaj +1 more source
Reduced zero-divisor graphs of posets [PDF]
Transactions on Combinatorics, 2018 This paper investigates properties of the reduced zero-divisor graph of a poset. We show that a vertex is an annihilator prime ideal if and only if it is adjacent to all other annihilator prime ideals and there are always two annihilator prime ideals ...
Deiborlang Nongsiang, Promode Saikia
doaj +1 more source
Edge-partitioning graphs into regular and locally irregular components [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 A graph is locally irregular if every two adjacent vertices have distinct degrees. Recently, Baudon et al. introduced the notion of decomposition into locally irregular subgraphs.
Julien Bensmail, Brett Stevens
doaj +1 more source
Total Colouring of New Classes of Subcubic graphs
Theory and Applications of Graphs, 2022 The total chromatic number of a graph $G$, denoted $\chi^{\prime\prime}(G)$, is the least number of colours needed to colour the vertices and the edges of $G$ such that no incident or adjacent elements (vertices or edges) receive the same colour.
Sethuraman G, Velankanni Anthonymuthu
doaj +1 more source
On prime labeling of union of tadpole graphs [PDF]
, 2022 summary:A graph $G$ of order $n$ is said to be a prime graph if its vertices can be labeled with the first $n$ positive integers in such a way that the labels of any two adjacent vertices in $G$ are relatively prime. If such a labeling on $G$ exists then
Patel, Sanjaykumar K., Vasava, Jayesh B.
core +1 more source