Available online through ISSN

Similar documents
The Multiplicative Zagreb Indices of Products of Graphs

ON BANHATTI AND ZAGREB INDICES

Available online at J. Math. Comput. Sci. 4 (2014), No. 3, ISSN:

Domination Number of Square of Cartesian Products of Cycles

R Index of Some Graphs

A New Multiplicative Arithmetic-Geometric Index

Symmetric Division Deg Energy of a Graph

ONE MODULO THREE GEOMETRIC MEAN LABELING OF SOME FAMILIES OF GRAPHS

A Study on Total Rebellion Number in Graphs

The Hypergeometric Coupon Collection Problem and its Dual

Observations on Derived K-Fibonacci and Derived K- Lucas Sequences

A new sequence convergent to Euler Mascheroni constant

ON ABSOLUTE MATRIX SUMMABILITY FACTORS OF INFINITE SERIES. 1. Introduction

DISTANCE BETWEEN UNCERTAIN RANDOM VARIABLES

Adjacent vertex distinguishing total coloring of tensor product of graphs

Generalized Fibonacci-Like Sequence and. Fibonacci Sequence

FUZZY RELIABILITY ANALYSIS OF COMPOUND SYSTEM BASED ON WEIBULL DISTRIBUTION

International Journal of Mathematical Archive-7(6), 2016, Available online through ISSN

PI Polynomial of V-Phenylenic Nanotubes and Nanotori

JORGE LUIS AROCHA AND BERNARDO LLANO. Average atchig polyoial Cosider a siple graph G =(V E): Let M E a atchig of the graph G: If M is a atchig, the a

MORE GRAPHS WHOSE ENERGY EXCEEDS THE NUMBER OF VERTICES

Bi-Magic labeling of Interval valued Fuzzy Graph

International Journal of Mathematical Archive-4(9), 2013, 1-5 Available online through ISSN

Fuzzy n-normed Space and Fuzzy n-inner Product Space

COMPLEXITY OF STAR (m, n)-gon AND OTHER RELATED GRAPHS

Bounds of Balanced Laplacian Energy of a Complete Bipartite Graph

Lebesgue Constant Minimizing Bivariate Barycentric Rational Interpolation

International Journal of Multidisciplinary Research and Modern Education (IJMRME) ISSN (Online): (

On the Fibonacci-like Sequences of Higher Order

Int. Journal of Math. Analysis, Vol. 6, 2012, no. 31, S. Panayappan

Name Period ALGEBRA II Chapter 1B and 2A Notes Solving Inequalities and Absolute Value / Numbers and Functions

AVERAGE MARKS SCALING

Refinements of Jensen s Inequality for Convex Functions on the Co-Ordinates in a Rectangle from the Plane

On Some Properties of Tensor Product of Operators

Metric Dimension of Some Graphs under Join Operation

Research Article Some E-J Generalized Hausdorff Matrices Not of Type M

Research Article Nonexistence of Homoclinic Solutions for a Class of Discrete Hamiltonian Systems

Weakly Connected Closed Geodetic Numbers of Graphs

The Differential Transform Method for Solving Volterra s Population Model

Citation Journal of Inequalities and Applications, 2012, p. 2012: 90

Some inequalities for the Kirchhoff index of graphs

A NOTE ON SPECTRAL CONTINUITY. In Ho Jeon and In Hyoun Kim

Some results on the Apostol-Bernoulli and Apostol-Euler polynomials

A GENERALIZED BERNSTEIN APPROXIMATION THEOREM

Miskolc Mathematical Notes HU e-issn Bounds for Laplacian-type graph energies. Ivan Gutman, Emina Milovanovic, and Igor Milovanovic

Research Article A Unified Weight Formula for Calculating the Sample Variance from Weighted Successive Differences

6.4 Binomial Coefficients

Automated Proofs for Some Stirling Number Identities

On Order of a Function of Several Complex Variables Analytic in the Unit Polydisc

AN EFFICIENT ESTIMATION METHOD FOR THE PARETO DISTRIBUTION

Binomial transform of products

Discrete Mathematics: Lectures 8 and 9 Principle of Inclusion and Exclusion Instructor: Arijit Bishnu Date: August 11 and 13, 2009

Solution of Differential Equation from the Transform Technique

COMP 2804 Solutions Assignment 1

International Journal of Mathematical Archive-5(7), 2014, Available online through ISSN

Double Derangement Permutations

Compositions of Fuzzy T -Ideals in Ternary -Semi ring

Ma 530 Introduction to Power Series

1.2 AXIOMATIC APPROACH TO PROBABILITY AND PROPERTIES OF PROBABILITY MEASURE 1.2 AXIOMATIC APPROACH TO PROBABILITY AND

Complete Convergence for Asymptotically Almost Negatively Associated Random Variables

ON STATISTICAL CONVERGENCE AND STATISTICAL MONOTONICITY

(s)h(s) = K( s + 8 ) = 5 and one finite zero is located at z 1

Journal of Mathematical Analysis and Applications 250, doi: jmaa , available online at http:

distinct distinct n k n k n! n n k k n 1 if k n, identical identical p j (k) p 0 if k > n n (k)

Fixed Point Theorems for Expansive Mappings in G-metric Spaces

CYCLIC HYPERGROUPS WHICH ARE INDUCED BY THE CHARACTER OF SOME FINITE GROUPS

ON THE FUZZY METRIC SPACES

Application of Homotopy Analysis Method for Solving various types of Problems of Ordinary Differential Equations

A class of spectral bounds for Max k-cut

Alliance Partition Number in Graphs

SZEGO S THEOREM STARTING FROM JENSEN S THEOREM

A New Type of q-szász-mirakjan Operators

PAijpam.eu ON TENSOR PRODUCT DECOMPOSITION

Research Article Carleson Measure in Bergman-Orlicz Space of Polydisc

Uniform Strict Practical Stability Criteria for Impulsive Functional Differential Equations

A collocation method for singular integral equations with cosecant kernel via Semi-trigonometric interpolation

IJITE Vol.2 Issue-11, (November 2014) ISSN: Impact Factor

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Research Article Moment Inequality for ϕ-mixing Sequences and Its Applications

Research Article The Terminal Hosoya Polynomial of Some Families of Composite Graphs

PAijpam.eu IRREGULAR SET COLORINGS OF GRAPHS

Math 4707 Spring 2018 (Darij Grinberg): midterm 2 page 1. Math 4707 Spring 2018 (Darij Grinberg): midterm 2 with solutions [preliminary version]

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Integrals of Functions of Several Variables

CHAPTER 2 NEIGHBORHOOD CONNECTED PERFECT DOMINATION IN GRAPHS

Number of Spanning Trees of Circulant Graphs C 6n and their Applications

Polynomial identity testing and global minimum cut

Integer Linear Programming

Modified Method for Fixed Charge Transportation Problem

Disjoint Systems. Abstract

S. A. ALIEV, Y. I. YELEYKO, Y. V. ZHERNOVYI. STEADY-STATE DISTRIBUTIONS FOR CERTAIN MODIFICATIONS OF THE M/M/1/m QUEUEING SYSTEM

Research Article Robust Linear Programming with Norm Uncertainty

Some Common Fixed Point Theorems in Cone Rectangular Metric Space under T Kannan and T Reich Contractive Conditions

TRACES OF HADAMARD AND KRONECKER PRODUCTS OF MATRICES. 1. Introduction

The Wiener Index for Weighted Trees

Generalization of Contraction Principle on G-Metric Spaces

Correspondence should be addressed to Wing-Sum Cheung,

) is a square matrix with the property that for any m n matrix A, the product AI equals A. The identity matrix has a ii

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Transcription:

Iteratioal Research Joural of Pure Algebra-6(7, 06, 34-347 Aailable olie through wwwrjpaifo ISSN 48 9037 MULTIPLICATIVE HYPER-ZAGREB INDICES AND COINDICES OF GRAPHS: COMPUTING THESE INDICES OF SOME NANOSTRUCTURES V R KULLI Departet of Matheatics, Gulbarga Uiersity, Gulbarga 58506, Idia (Receied O: -06-6; Reised & Accepted O: 5-07-6 ABSTRACT I this paper, we itroduce the first ad secod ultiplicatie hyper-zagreb idices of a graph The first ultiplicatie hyper-zagreb idex is defied as the product of squares of the su of the degrees of pairs of adjacet ertices The secod ultiplicatie hyper- Zagreb idex is defied as the product of squares of the product of the degrees of pairs of adjacet ertices Also we itroduce the first ad secod ultiplicatie hyper-zagreb coidices of a graph I this paper, the first ad secod ultiplicatie hyper-zagreb idices of cycles, coplete graphs, coplete bipartite graphs ad r-regular graphs are deteried Also we copute exact forulas of the ultiplicatie hyper-zagreb idices for G = TUSC 4 C 8 (S aotubes, G = VPHX [, ] aotues ad G = VPHY [, ] aotorus Keywords: Molecular graph, ultiplicatie hyper-zagreb idex, ultiplicatie hyper-zagreb coidex, aotubes, aotorus Matheatics Subject Classificatio: 05C05, 05C07 INTRODUCTION All graphs cosidered i this paper are fiite, coected, udirected without loops ad ultiple edges Ay udefied ter here ay be foud i Kulli [] Let G = (V(G, E(G be a graph with = V(G ertices ad = E(G edges The degree d G ( of a ertex is the uber of ertices adjacet to A olecular graph is a graph such that its ertices correspod to the atos ad the edges to the bods Cheical graph theory is a brach of atheatical cheistry which has a iportat effect o the deelopet of the cheical scieces I Cheical Sciece, the physico-cheical properties of cheical copouds are ofte odeled by eas of olecular graph based structure descriptors, which are referred to as topological idices The first ad secod ultiplicatie Zagreb idices of a graph G are defied as II ( G = dg ( u ad II ( G = dg ( u dg u V( G These two graph iariats are proposed by Todeshie et al i [] I [3], Eliasi, et al cosidered a ew ultiplicatie ersio of the first Zagreb idex as * II ( G = d G ( u + dg Recetly ay other ultiplicatie idices ad coidices of graphs were studied, for exaple, i [4, 5, 6, 7, 8, 9, 0,, ] I this paper, we iitiate a study of the ultiplicatie hyper-zagreb idices of graphs Correspodig Author: V R Kulli Departet of Matheatics, Gulbarga Uiersity, Gulbarga 58506, Idia Iteratioal Research Joural of Pure Algebra-Vol-6(7, July 06 34

V R Kulli / Multiplicatie Hyper-Zagreb Idices ad Coidices of Graphs: Coputig These Idices of / IRJPA- 6(7, July-06 FIRST MULTIPLICATIVE HYPER-ZAGREB INDEX We defie the first ultiplicatie hyper-zagreb idex of a graph Defiitio : The first ultiplicatie hyper-zagreb idex of a graph G is defied as HII ( G = d G ( u + dg e= Propositio : Let C be a cycle with 3 ertices The HII (C = 4 Proof: Let C be a cycle with 3 ertices Cosider HII ( C = dc ( u + d ( ( 4 C = + = u E( C Propositio 3: Let K be a coplete graph with ertices The HII ( K = ( ( Proof: Let K be a coplete graph with ertices The K has ( K ( ( K u E( K ( {( ( } HII K = d u + d = + = [( ] ( 06, RJPA All Rights Resered 343 ( edges Cosider Propositio 4: Let K, be a coplete bipartite graph with The HII (K, = (+ Proof: Let K, be a coplete bipartite graph with, + ertices ad edges Cosider HII ( K, = dk ( u d ( (, K +, = + u E( K, = ( + Corollary 5: Let K, be a star The HII (K, = (+ Theore A [, p3] Let G be a r-regular graph with ertices The G has Theore 6: Let G be a r-regular graph with ertices The HII (G = (r r Proof: Let G be a r-regular graph with ertices By Theore A, G has ( G ( G ( r ( HII G = d u + d = r + r = (r r 3 SECOND MULTIPLICATIVE HYPER-ZAGREB INDEX We defie the secod ultiplicatie hyper-zagreb idex of a graph r edges r edges Cosider Defiitio 7: The secod ultiplicatie hyper-zagreb idex of a graph G is defied as HII ( G = d G ( u dg e= Propositio 8: Let C be a cycle with 3 ertices The HII (C = 4 Proof: Let C be a cycle with 3 ertices Cosider HII ( C = dc ( u d ( ( 4 C = = u E( C Propositio 9: Let K be a coplete graph with ertices The HII (K = ( (

V R Kulli / Multiplicatie Hyper-Zagreb Idices ad Coidices of Graphs: Coputig These Idices of / IRJPA- 6(7, July-06 ( Proof: Let K be a coplete graph with ertices ad edges Cosider ( HII ( K = dk ( u d ( {( ( } K = u E( K = ( ( Propositio 0: Let K, be a coplete bipartite graph with The HII (K, = ( Proof: Let K, be a coplete bipartite graph with + ertices ad edges Cosider ( K ( (, K, ( HII K, = d u d = u E( K, = ( Corollary : Let K, be a star The KII (K, = Theore : Let G be a r-regular graph with ertices The HII (G = r r Proof: Let G be a r-regular graph with ertices By Theore A, G has r edges Cosider ( G ( G ( r ( HII G = d u d = r r = r r 4 FIRST AND SECOND MULTIPLICATIVE HYPER-ZAGREB COINDICES We defie the first ad secod ultiplicatie hyper-zagreb coidices of a graph Defiitio: The first ad secod ultiplicatie hyper-zagreb coidices of a graph G are defied as HII ( G = d G ( u + dg ( u E( G HII G dg u E( G u dg ( ( ( = 5 MULTIPLICATIVE HYPER ZAGREB INDICES OF TUSC 4 C 8 (S NANOTUBES Molecular graph TUSC 4 C 8 (S aotubes is a faily of aostructures that its structure cosists of cycles C 4 ad C 8 TUSC 4 C 8 (S aotubes is deoted by G = TUC 4 C 8 [, ] We copute the first ad secod ultiplicatie hyper-zagreb idices of G = TUC 4 C 8 [, ] aotubes Theore 3: Let G =TUC 4 C 8 [, ] be the TUSC 4 C 8 (S aotubes The HII (G = 4 4 5 8 4 4 6 HII (G = 4 4 5 8 6 4 4 Proof: Cosider G = TUC 4 C 8 [, ] (, {} aotubes We deote the uber of octagos C 8 i the first row of G by ad the uber of octagos C 8 i the first colu of G by I geeral case of the aotubes, there are 8 + 4 ertices/atos ad + 4 edges/bods, see Figure 3 - Figure- 06, RJPA All Rights Resered 344

V R Kulli / Multiplicatie Hyper-Zagreb Idices ad Coidices of Graphs: Coputig These Idices of / IRJPA- 6(7, July-06 We hae two partitios of the ertex set V(G as follows: V = { V(G/d G ( = }, V = + V 3 = { V(G/d G ( = 3}, V 3 = 8 By Figure, we hae three partitios of the edge set E(G as follows: * E = E = u E G / d u = d =, E = Now Now { ( G ( G ( } { ( G ( G ( } { ( G ( G ( } 4 4 4 E = E = u E G / d u =, d = 3, E = E = 4 5 6 5 6 E = E = u E G / d u = d = 3, E = E = 6 9 6 9 ( = ( + ( HII G d u d G G e= dg ( u dg dg ( u dg dg ( u dg = + + + u E4 u E5 u E6 4 ( 4 ( 5 ( 6 4 8 4 4 4 5 6 ( ( ( HII G = d u d G G e= dg ( u dg dg ( u dg dg ( u dg = * u E4 u E6 u E9 4 ( 4 ( 6 ( 9 4 8 4 4 4 6 9 6 MULTIPLICATIVE HYPER-ZAGREB INDICES OF V-PHENLENIC NANOTUES AND NANOTORUS Cheical Structures V-Pheyleic aotubes ad V-Pheyleic aotorus are widely used i Medical Sciece ad Pharaceutical field Thus we study ultiplicatie hyper-zagreb idices of these olecular structures fro a atheatical poit of iew I this sectio, we cosider the structures of V-Pheyleic aotubes VPHX[, ] ad V-Pheyleic aotorus VPHY[, ] (, {} ad copute their ultiplicatie hyper-zagreb idices Molecular graphs V-Pheyleic aotubes ad V-Pheyleic aotorus are two failies of aostructures that their structures cosist of cycles C 4, C 6 ad C 8 by differet copouds We deterie the first ad secod ultiplicatie hyper-zagreb idices of G = VPHX [, ] aotubes Theore 4: Let G = VPHX[, ] (, {} be the V-Pheyleic aotubes The HII (G = 5 8 8 0 6 HII (G = 6 8 9 8 0 Proof: Cosider G =VPHX[, ] (, {} aotubes We deote the uber of hexagos i the first row of G by ad the uber of hexagos i the first colu of G by I geeral case of this aotubes, there are 6 ertices/atos ad 9 edges/bods, see Figure Figure- 06, RJPA All Rights Resered 345

V R Kulli / Multiplicatie Hyper-Zagreb Idices ad Coidices of Graphs: Coputig These Idices of / IRJPA- 6(7, July-06 Fro the structure of G, we hae two partitios of the ertex set V(G as follows: V = V ( G : dg =, V = { } { ( G ( } V3 = V G : d = 3, V 3 = 6 Also fro the structure of G, we hae two partitios of the edge set E(G as follows: E = E * = e = u E G : d u =, d =, E = E * = 4 Now { ( G ( G ( } ( ( ( 5 6 5 6 { G G } E = E = e = u E G : d u = d = 3, E = E = 9 5 6 9 6 9 ( = ( + ( G G e= u E( G = dg ( u + d ( ( ( G dg u + d G u E u E HII G d u d 5 6 4 9 ( 5 ( 6 8 8 0 5 6 ( = ( ( G G e= u E( G HII G d u d dg ( u d ( ( ( G dg u d G = u E6 u E9 4 9 5 ( 6 ( 9 8 8 0 6 9 Now we copute the first ad secod ultiplicatie hyper-zagreb idices of G = VPHY[, ] aotorus Theore 5: Let G = VPHY[, ] (, {} be the V-Pheyleic aotorus The HII (G = 6 8 HII (G = 9 8 Proof: Cosider G = VPHY[, ] (, {} aotorus We deote the uber of hexagos i the first row of G by ad the uber of hexagos i the first colu of G by I geeral case of this aotorus, there are 6 ertices/atos ad 9 edges/bods, see Figure 3 Figure-3 Fro the structure G, there is oly oe partitio of the ertex set V(G as follows: V = V G : d = 3, V = 6 { ( G ( } 3 3 Also fro the structure of G, there is oly oe partitio of the edge set E(G as follows: E = E = u E G : d u = d = 3, E = E = 9 { ( G ( G ( } 6 9 6 9 06, RJPA All Rights Resered 346

V R Kulli / Multiplicatie Hyper-Zagreb Idices ad Coidices of Graphs: Coputig These Idices of / IRJPA- 6(7, July-06 Now HII( G = dg ( u + d ( G REFERENCES e= u E( G ( ( = dg u + d G u E6 6 8 6 ( 9 = = ( = ( ( HII G d u d G G e= u E( G = dg ( u d ( G * u E9 8 ( 9 = 9 = 9 VRKulli, College Graph Theory, Vishwa Iteratioal Publicatios, Gulbarga, Idia (0 RTodeshie ad V Cosoi, New local ertex iariats ad olecular descriptors based o fuctios of ertex degrees, MATCH Cou Math Coput Che 64(00 359-37 3 MEliasi, AIraaesh ad I Guta, Multiplicatie ersios of first Zagreb idex, MATCH Cou Math Coput Che 68(0 7-30 4 KCDas, A Yurttas, M Toga, AS Ceik ad N Cagul, The ultiplicatie Zagreb idices of graph operatios, Joural of Iequalities ad Applicatios, 03, 03:90, -4 5 VR Kulli, First ultiplicatie K Bahatti idex ad coidex of graphs, Aals of Pure ad Applied Matheatics, ( (06 79-8 6 VR Kulli, Secod ultiplicatie K Bahatti idex ad coidex of graphs, Joural of Coputer ad Matheatical Scieces, 7(5, (06 54-58 7 VR Kulli, Multiplicatie K hyper-bahatti idices ad coidices of graphs, Iteratioal Joural of Matheatical Archie, 7(6, (06 60-65 8 VR Kulli, o ultiplicatie K Bahatti idices ad ultiplicatie K hyper-bahatti idices of V-Pheyleic aotubes ad aotorus, Aals of Pure ad Applied Matheatics, (, (06, 45-50 9 J Liu ad Q Zhag, Sharp upper bouds for ultiplicatie Zagreb idices, MATCH Cou Math Coput Che 68(0 3-40 0 H Wag ad H Bao, A ote o ultiplicatie su Zagreb idex, South Asia J Math (6, (0 578-583 S Wag ad B Wei, Multiplicatie Zagreb idices of k-tree, Discrete Applied Math 80, (05 68-75 K Xu, KC Das ad K Tag, O the ultiplicatie Zagreb coidex of graphs, Opuscula Math 33(, 9-04 (03 Source of Support: Nil, Coflict of iterest: Noe Declared [Copy right 06, RJPA All Rights Resered This is a Ope Access article distributed uder the ters of the Iteratioal Research Joural of Pure Algebra (IRJPA, which perits urestricted use, distributio, ad reproductio i ay ediu, proided the origial work is properly cited] 06, RJPA All Rights Resered 347