ARTICLES

Filter  
Active filters 0
Remove
  

Refine your searches by:

Collections
Education
Public health
Social Sciences
Biology
Medicine / Sub specialtie
Technology
Research
Languages
Pure sciences
Architecture and Urbanism
all records (76)

Languages
English
Spanish
Portuguese
French
German

Countries
Indonesia
USA
Brazil
Ukraine
South Africa
Poland
Italy
Australia
Spain
Pakistan
all records (78)

Years
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
all records (24)

Filter  
 
1.816.934  Articles
1 of 181.694 pages  |  10  records  |  more records»
For any non-abelian group G, the non-commuting graph of G, G=GG, is a graph with vertex set G \ Z(G), where Z(G) is the set of elements of G that commute with every element of G and distinct non-central elements x and y of G are joined by an edge if and o... see more

The non-commuting graph G(G) of a non-abelian group G is defined as follows. The vertex set V(G(G)) of ?(G) is G \ Z(G) where Z(G) denotes the center of G and two vertices x and y are adjacent if and only if xy ? yx. We prove that the rainbow k-connectivi... see more

A rainbow path in an edge-colored graph G is a path that every two edges have different colors. The minimum number of colors needed to color the edges of G such that every two distinct vertices are connected by a rainbow path is called... see more

For a nonabelian group G, the non-commuting graph G of G is defined as the graph with vertex-set G-Z(G), where Z(G) is the center of G, and two distinct vertices of G are adjacent if they do not commute in G. In this paper, we investigate the detour index... see more

For a nilpotent group GG, let ?(G)\Xi(G) be the difference between the complement of the generating graph of GG and the commuting graph of GG, with vertices corresponding to central elements of GG removed. That is, ?(G)\Xi(G) has vertex set G\Z(G)G \setmi... see more

Given a group G, the intersection power graph of G, denoted by GI(G), is the graph with vertex set G and two distinct vertices x and y are adjacent in GI(G) if there exists a non-identity element z ? G such that xm=z=yn, for some m, n ? N, i.e. x ~ y in G... see more

Non-native English language teachers have long been de-professionalized being adopters of preponderant globalized English language teaching (ELT) coursebooks that offer an insignificant contribution to their students’ English language learning. This has s... see more

Let G be a finite group. The enhanced power graph GGe 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 con... see more

Commuting graph C(G) of a non-Abelian group G is a graph that contains all elements of G as its vertex set and two distinct vertices in C(G) will be adjacent if they are commute in G. In this paper we discuss commuting graph of dihedral group D2n. We show... see more

1 of 181.694 pages  |  10  records  |  more records»