power graph
Recently Published Documents


TOTAL DOCUMENTS

102
(FIVE YEARS 54)

H-INDEX

11
(FIVE YEARS 3)

2021 ◽  
pp. 1-7
Author(s):  
M. Mirzargar ◽  
R. Scapellato
Keyword(s):  

Author(s):  
Peter J. Cameron ◽  
Pallabi Manna ◽  
Ranjit Mehatari
Keyword(s):  

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-4
Author(s):  
Lubna Gul ◽  
Gohar Ali ◽  
Usama Waheed ◽  
Sumiya Nasir

Let G n , m represent the family of square power graphs of order n and size m , obtained from the family of graphs F n , k of order n and size k , with m ≥ k . In this paper, we discussed the least eigenvalue of graph G in the family G n , m c . All graphs considered here are undirected, simple, connected, and not a complete K n for positive integer n .


Author(s):  
Amit Sehgal ◽  
Neeraj Takshak ◽  
Pradeep Maan ◽  
Archana Malik

The power graph of a finite group G is a special type of undirected simple graph whose vertex set is set of elements of G, in which two distinct vertices of G are adjacent if one is the power of other. Let [Formula: see text] be a finite abelian 2-group of order [Formula: see text] where [Formula: see text]. In this paper, we establish that the power graph of finite abelian group G always has graceful labeling without any condition on [Formula: see text].


2021 ◽  
pp. 2150012
Author(s):  
P. C. Lisna ◽  
M. S. Sunitha

A b-coloring of a graph [Formula: see text] is a proper coloring of the vertices of [Formula: see text] such that there exist a vertex in each color class joined to at least one vertex in each other color classes. The b-chromatic number of a graph [Formula: see text], denoted by [Formula: see text], is the largest integer [Formula: see text] such that [Formula: see text] has a b-coloring with [Formula: see text] colors. The b-chromatic sum of a graph [Formula: see text], denoted by [Formula: see text], is introduced and it is defined as the minimum of sum of colors [Formula: see text] of [Formula: see text] for any [Formula: see text] in a b-coloring of [Formula: see text] using [Formula: see text] colors. A graph [Formula: see text] is b-continuous, if it admits a b-coloring with [Formula: see text] colors, for every [Formula: see text]. In this paper, the [Formula: see text]-continuity property of corona of two cycles, corona of two star graphs and corona of two wheel graphs with unequal number of vertices is discussed. The b-continuity property of corona of any two graphs with same number of vertices is also discussed. Also, the b-continuity property of Mycielskian of complete graph, complete bipartite graph and paths are discussed. The b-chromatic sum of power graph of a path is also obtained.


Author(s):  
Ajay Kumar ◽  
Lavanya Selvaganesh ◽  
Peter J. Cameron ◽  
T. Tamizh Chelvam

Sign in / Sign up

Export Citation Format

Share Document