Harmonious labeling for the corona graphs of small complete graph

On Harmonious Labeling of Corona Graphs

Journal of Applied Mathematics ◽

10.1155/2014/627248 ◽

2014 ◽

Vol 2014 ◽

pp. 1-4 ◽

Cited By ~ 3

Author(s):

Martin Bača ◽

Maged Z. Youssef

Keyword(s):

Harmonious Labeling ◽

Corona Graphs

A graphGwithqedges is said to be harmonious, if there is an injectionffrom the vertices ofGto the group of integers moduloqsuch that when each edgexyis assigned the labelf(x)+f(y)(modq), the resulting edge labels are distinct. In this paper, we study the existence of harmonious labeling for the corona graphs of a cycle and a graphGand for the corona graph ofK2and a tree.

Download Full-text

Super edge bimagic harmonious labeling of some Corona graphs

Malaya Journal of Matematik ◽

10.26637/mjm0s20/0091 ◽

2020 ◽

Vol S (1) ◽

pp. 487-490

Author(s):

L. Merrit Anish ◽

M. Regees ◽

T. Nicholas

Keyword(s):

Harmonious Labeling ◽

Corona Graphs

Download Full-text

On the Generalized Distance Energy of Graphs

Mathematics ◽

10.3390/math8010017 ◽

2019 ◽

Vol 8 (1) ◽

pp. 17 ◽

Cited By ~ 4

Author(s):

Abdollah Alhevaz ◽

Maryam Baghipur ◽

Hilal A. Ganie ◽

Yilun Shang

Keyword(s):

Lower Bounds ◽

Complete Graph ◽

Connected Graph ◽

Distance Matrix ◽

Wiener Index ◽

Diagonal Matrix ◽

Upper And Lower Bounds ◽

Star Graph ◽

Extremal Graphs ◽

Generalized Distance

The generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G ) + ( 1 − α ) D ( G ) , where 0 ≤ α ≤ 1 , D ( G ) is the distance matrix and T r ( G ) is the diagonal matrix of the node transmissions. In this paper, we extend the concept of energy to the generalized distance matrix and define the generalized distance energy E D α ( G ) . Some new upper and lower bounds for the generalized distance energy E D α ( G ) of G are established based on parameters including the Wiener index W ( G ) and the transmission degrees. Extremal graphs attaining these bounds are identified. It is found that the complete graph has the minimum generalized distance energy among all connected graphs, while the minimum is attained by the star graph among trees of order n.

Download Full-text

On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue

Mathematics ◽

10.3390/math9050512 ◽

2021 ◽

Vol 9 (5) ◽

pp. 512

Author(s):

Maryam Baghipur ◽

Modjtaba Ghorbani ◽

Hilal A. Ganie ◽

Yilun Shang

Keyword(s):

Lower Bounds ◽

Complete Graph ◽

Distance Matrix ◽

Upper And Lower Bounds ◽

Laplacian Eigenvalue ◽

Signless Laplacian ◽

Graph Parameters ◽

Simple Connected Graph ◽

Second Largest Eigenvalue ◽

Reciprocal Distance Matrix

The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the total reciprocal distance vertices. In the present work, some upper and lower bounds for the second-largest eigenvalue of the signless Laplacian reciprocal distance matrix of graphs in terms of various graph parameters are investigated. Besides, all graphs attaining these new bounds are characterized. Additionally, it is inferred that among all connected graphs with n vertices, the complete graph Kn and the graph Kn−e obtained from Kn by deleting an edge e have the maximum second-largest signless Laplacian reciprocal distance eigenvalue.

Download Full-text

Edge even graceful labeling of some corona graphs

Journal of Physics Conference Series ◽

10.1088/1742-6596/1872/1/012007 ◽

2021 ◽

Vol 1872 (1) ◽

pp. 012007

Author(s):

D Jayantara ◽

Purwanto ◽

S Irawati

Keyword(s):

Graceful Labeling ◽

Corona Graphs

Download Full-text

Undirected Complete Graph to Design New Public Key Cryptosystem

Journal of Physics Conference Series ◽

10.1088/1742-6596/1897/1/012045 ◽

2021 ◽

Vol 1897 (1) ◽

pp. 012045

Author(s):

Karrar Taher R. Aljamaly ◽

Ruma Kareem K. Ajeena

Keyword(s):

Complete Graph ◽

Public Key ◽

Public Key Cryptosystem ◽

New Public

Download Full-text

Turán theorems for unavoidable patterns

Mathematical Proceedings of the Cambridge Philosophical Society ◽

10.1017/s030500412100027x ◽

2021 ◽

pp. 1-20

Author(s):

ANTÓNIO GIRÃO ◽

BHARGAV NARAYANAN

Keyword(s):

Complete Graph ◽

Blow Up ◽

Ramsey Numbers ◽

Order Of Magnitude ◽

Transitive Tournament ◽

Unavoidable Patterns

Abstract We prove Turán-type theorems for two related Ramsey problems raised by Bollobás and by Fox and Sudakov. First, for t ≥ 3, we show that any two-colouring of the complete graph on n vertices that is δ-far from being monochromatic contains an unavoidable t-colouring when δ ≫ n−1/t, where an unavoidable t-colouring is any two-colouring of a clique of order 2t in which one colour forms either a clique of order t or two disjoint cliques of order t. Next, for t ≥ 3, we show that any tournament on n vertices that is δ-far from being transitive contains an unavoidable t-tournament when δ ≫ n−1/[t/2], where an unavoidable t-tournament is the blow-up of a cyclic triangle obtained by replacing each vertex of the triangle by a transitive tournament of order t. Conditional on a well-known conjecture about bipartite Turán numbers, both our results are sharp up to implied constants and hence determine the order of magnitude of the corresponding off-diagonal Ramsey numbers.

Download Full-text