Zagreb Radio Indices of Graphs
|
|
- Richard Lawrence George
- 5 years ago
- Views:
Transcription
1 Volume 118 No , ISSN: (printed version); ISSN: (on-line version) url: doi: /ijpam.v118i10.75 ijpam.eu Zagreb Radio Indices of Graphs Joseph Varghese Kureethara 1 and Anna Treesa Raj 1 Christ University, Bengaluru , India frjoseph@christuniversity.in Christ University, Bengaluru , India anna.raj@maths.christuniversity.in Abstract Radio coloring is a distanced based vertex coloring such that the color difference of any two distinct vertices in the graph must be at least the difference of the diameter of the graph and the distance between the vertices plus one. Zagreb index is a topological index defined for the degrees of the vertices of a graph. We introduce the analogical Zagreb radio indices for graphs. The first and second Zagreb radio indices of some popular graphs are computed. AMS Subject Classification: 05C07, 05C40, 05C9, 05C90, 9E10 Key Words and Phrases: Radio coloring, Radio number, First Zagreb radio index, Second Zagreb radio index, Topological index, QSAR, Chemical Graph Theory, Channel Assignment 1 Introduction Graph labeling[4] is an ever-growing area of research in graph theory. It is an assignment of labels to the vertices or edges or both of a graph. Integers are the most famous labels as operations on them are relatively easier. Graph coloring is a special type of graph labeling. A graph coloring is said to be proper coloring if no two adjacent vertices have the same color. For the easiness of computing, we assign numbers in the place of colors. There are numerous types of vertex colorings. For basic concepts in graph theory and that of colorings we refer to [1]. Radio coloring is a type of vertex coloring. It can be presented as a function c from V(G) to the set of nonnegative integers such that c(u) c(v) diam(g) + 1 d(u, v) u, v V (G). Here, d(u, v) denotes the distance between the vertices u and v and diam(g) is the maximum of all such distances mentioned as the diameter of the graph G. The maximum value assigned to a vertex by c is the c-span of G. The minimum of all c-spans is defined as the radio number (rn(g)) of G.[1] The term radio coloring is due to its connection with channel assignment problem.[8] 1 343
2 Joseph Varghese Kureethara, Anna Treesa Raj Graph theory got a lot of applications in the field of chemistry. Structural formulas of covalently bonded atoms can be represented as graphs called molecular graphs or constitutional graphs. For quantitative structure-activity relationships (QSAR), which are important especially for drug design, one looks for correlations between physical, chemical, or biochemical properties (possessing a continuous variation and being expressed numerically) and chemical structures. For this purpose a different approach was proposed by H. Wiener in 1947 with the introduction of topological indices. Topological indices are numerical values associated with a graph which determines the topology of the graphs.[11] Among a host of topological indices, we deal only with the Zagreb indices of a graph. Zagreb index is a topological index defined for the degrees of the vertices.[5] The first Zagreb index is M 1 (G) v d(v). The second Zagreb index is M (G) uv E(G) d(u)d(v). We, now, introduce the analogical Zagreb radio indices for graphs. Definition 1. The First Zagreb Radio Index is M rc1 (G) u V (G) c(u) where c is the radio coloring whose span is the radio number of the graph G. Definition. The Second Zagreb Radio Index is M rc (G) uv E(G) c(u)c(v) where c is the radio coloring whose span is the radio number of the graph and c(u)c(v) is the minimum. uv E(G) The first and second Zagreb radio indices of some popular graphs are computed in the subsequent sections. The f orgotten topological index is relatively high in magnitude in comparison with the first and second Zagreb indices.[10] The first and second Zagreb radio indices give a higher quantity closer to the f orgotten topological index. Radio Number of Certain Graphs In this section, we provide the radio numbers of certain graphs. Definition 3. A gear graph, G n, is obtained from a wheel graph, W n, by adding a vertex to each edge of the cycle C n.[3] The radio numbers some popular graphs are given in the next table.[1],[3] Graph Vertices Radio Number Star graph (K 1,n ) n + 1 n + 1 Complete graph (K n ) n n 1 Complete bipartite graph (K m,n ) m + n m + n Wheel graph (W n ) n + 1 n + 1 Gear graph (G n ) n + 1 4n + 3 Main Results In radio coloring, we use zero also as a color. It is to be noted that the conditions of radio coloring obviously imply that every vertex in a graph receives distinct color. 344
3 Zagreb Radio Indices of Graphs 3 However, they need not be consecutive. 3.1 Zagreb radio indices of stars Theorem 4. 1 for n. The first Zagreb radio index of a star, M rc1 (K 1,n ) (n+1)(n+)(n+3) Proof. We know that for n, diam(k 1,n ). Moreover, radio number, rn(k 1,n ) n+1. This implies that the colors are 0,, 3,..., n + 1. Therefore, Hence, the result. M rc1 (K 1,n ) u V (K 1,n) c(u) (n + 1) (n + 1)(n + )(n + 3) 1 Theorem 5. The second Zagreb radio index of a star graph, M rc (K 1,n ) 0 for all n. Proof. We consider star graphs with at least three vertices. We have, diam(k 1,n ). The optimal radio coloring is possible when the central vertex is given color zero and other vertices, the colors,3,...,n+1. Hence, rn(k 1,n ) n+1. We have, M rc (K 1,n ) uv E(K 1,n) c(u)c(v). Since every edge of K 1,n is incident to the central vertex c(u)c(v) is 0 for all uv E(K 1,n ). So, M rc (K 1,n ) 0 for all n. 3. Zagreb radio indices of complete graphs Theorem. The first Zagreb radio index of complete graph, M rc1 (K 1,n ) (n)(n 1)(n 1) for n 3. Proof. We know that diam(k n ) 1, since n 3. We can rewrite the radio coloring condition as c(u) c(v) 1. So, the vertices can be colored with the consecutive integers from 0 to n 1. Hence, rn(k n ) n 1. Therefore, M rc1 (K n ) u V (K 1,n) c(u) (n 1) (n)(n 1)(n 1) Theorem 7. The second Zagreb radio index of complete graph, M rc (K n ) (n 1)(n )(3n n) 4 n
4 4 Joseph Varghese Kureethara, Anna Treesa Raj Proof. Let v 0, v 1,..., v n 1 be the vertices of K n. Let c be a coloring such that c(v i ) i. As c(v i ) c(v j ) 1 for i j, the coloring c is a required radio coloring. Since every vertex is adjacent to every the other vertex it will satisfy the minimality condition also. We have to find c(v i )c(v j ) for all v i v j E(K n ). However, c(v 0 )c(v i ) 0 i. Therefore, M rc (K n ) c(u)c(v) uv E(K n) c(v i )c(v j ) where i j, and i and j 0 ij n n 1 i1 ji+1 n i i1 n 1 ji+1 But, n 1 n(n 1) ji+1 j n So, M rc (K n ) Hence, the result. i1 n i1 n i1 ij (since every edge is counted exactly once) j i(i + 1) n(n 1) i( n(n 1) i( n(n 1) i n i(i + 1) ) i(i + 1) ) i1 k k (k + 1) n(n 1) (n 1)(n ) 1 n k 3 + k ) ( n i1 i1 n(n 1) (n 1)(n ) 1 ((n 1)(n ) 1 ((n 1)(n )(n 3) ) (n 1)(n ) (3n n) Zagreb radio indices of complete bipartite graphs Theorem 8. The second Zagreb radio index of complete bipartite graphs, M rc (K m,n ) mn (n + mn (m + n) 1) where n m. 4 Proof. Consider a complete bipartite graph K m,n. Let X and Y be the partite sets of the vertex set. Let X m and Y n. Let the vertices of X be ) 34
5 Zagreb Radio Indices of Graphs 5 v 0, v 1,..., v m 1 and the vertices of Y be u 0, u 1,..., u n 1. As in teh previous theorem, we can see that the coloring c given by c(u i ) i and c(v i ) i + n + 1, is the required radio coloring. Since each vertex of X is adjacent to all the vertices of Y, this will satisfy the minimality condition also. We compute now M rc (K m,n ). We have, M rc (K m,n ) uv E(K m,n) i1 c(u)c(v) n 1 m 1 c(u i ) c(v j ) n 1 i1 m 1 i j0 (n j) j0 n 1 i(n n n + m) i1 n 1 i(nm + ( m)) i1 n(n 1) (nm + n m(n 1) + m(m + 1) ) nm(n 1)(m + 1) 4 n m(n 1 + nm(n 1)(m + 1) 4 mn 4 (n + mn (m + n) 1) Hence the result. Theorem 9. The first Zagreb radio index of complete bipartite graph, M rc1 (K m,n ) (n+m)3 +3(n+m) +(n+m) n where n m. Proof. Consider a complete bipartite graph K m,n. Given that n m. Let X and Y be the partite sets of the vertex set. Let X m and Y n. Let the vertices of X be v 0, v 1,..., v m 1 and the vertices of Y be u 0, u 1,..., u n 1. Define a coloring c such that c(u i ) i and c(v i ) i + n + 1. It is not difficult to check that this coloring is the required optimal radio coloring. Hence, rn(k m,n )m + n. 347
6 Joseph Varghese Kureethara, Anna Treesa Raj Therefore, M rc1 (K m,n ) u V (K m,n) c(u) (n 1) + (n + 1) (m + n) (m + n) n (m + n)(m + n + 1)((m + n) + 1) n ((m + n) + (m + n))((m + n) + 1) n (n + m)3 + 3(n + m) + (n + m) n 3.4 The first Zagreb radio indices of wheel graphs and gear graphs Theorem 10. The first Zagreb radio index of wheel graph, M rc1 (W n ) (n+1)(n+)(n+3) 1 for n 5. Proof. Let z be the central vertex and v 1, v,..., v n be the vertices on the n-cycle. Consider the coloring c such that c(z) 0, the vertices v 1, v,..., v n are assigned with consecutive even numbers beginning with and the vertices v n +1,.., v n are labeled with consecutive odd integers beginning with 3. It is not difficult to check that this is the required optimal radio coloring. Thus, rn(w n ) n+1. We compute M rc1 (W n ) analysing two cases. Case 1: n k+1 Given c(z) 0. The vertices v 1, v,..., v k+1 are assigned the colors, 4,..., (k + 1) respectively and the vertices v k+,..., v k+i,..., v n will be given the colors 3, 5,..., i 1,..., k + 1, respectively. Therefore, M rc1 (W n ) u V (W n) c(u) (k + 1) + (k + ) n + (n + 1) (n + 1)(n + )(n + 3) 1 Case : n k Given c(z) 0. The vertices v 1, v,..., v k are assigned the colors, 4,..., k respectively and the vertices v k+1, v k+,..., v k+i,..., v n will be given the colors 3, 5,..., i + 348
7 Zagreb Radio Indices of Graphs 7 1,..., k + 1, respectively. Therefore, M rc1 (W n ) u V (W n) Hence, M rc1 (W n ) (n+1)(n+)(n+3) 1. c(u) (k) + (k + 1) n + (n + 1) (n + 1)(n + )(n + 3) 1 Theorem 11. The first Zagreb radio index of gear graph on n+1 vertices is given by, M rc1 (G n ) n3 +45n +35n for n 7. 3 Proof. Let the central vertex be labeled z and the vertices adjacent to the center are labeled sequentially v 1, v,..., v k. The vertices not adjacent to the center are labeled sequentially w 1, w,...w n, using the same orientation chosen for the v i?s. If n is odd then we specify that w 1 is adjacent to v 1 and v, otherwise w 1 is adjacent to v 1 and v n. To make the labeling simple, Fernandez et al.[3] relabeled the vertices as x 0, x 1, x,..., x n corresponding to z, w 1, w 3,..., w n, w, w 4,..., w n 1, v 1, v,... v n when n is odd and to z, w 1, w 3,..., w n 1, w, w 4,..., w n, v 1, v,... v n when n is even. The optimal radio coloring c given in [3] is as follows. The central vertex is given the color 0. For 1 i n, c(x i ) + i and for n + 1 i n, c(x i ) n (i n). Therefore, M rc1 (G n ) (k + 3) + (n + 4) + (n + 7) (4n + 1) Consider the following summations (k + 3) (k + 3)(k + 4)(4k + 7) 5 (1) (n + 4) + (n + 7) (4n + 1) n in+1 n in+1 n(n + 1) + (n (i n)) (n + 1) + 9(i n) + (n + 1)(i n) n n(n + 1) n (n + 1) + 9 n 9(i n) + (n + 1) n in+1 in+1 (i + n ni) + (n + 1) n in+1 in+1 i () (i n) 349
8 8 Joseph Varghese Kureethara, Anna Treesa Raj n in+1 Finally, (i + n ni) n(n + 1)(4n + 1) n 3 n(n + 1) n( n3 + 3n + n n(n + 1)(n + 1) n(n + 1) ) + (3) (n + 1) n in+1 i (n + 1)( 3n + n ) 9n 3 + 1n + 3n (4) Substituting (3) and (4) in () and simplifying we get, (n + 4) + (n + 7) (4n + 1) 7n n + 11 n (5) (1) + (5) (k + 3)(k + 4)(4k + 7) (n + )(n + 3)(n + 5) Hence, M rc1 (G n ) n3 + 45n + 35n n n + 11 n 5 + 7n n + 11 n 4 Conclusion Analogous to the Zagreb indices we have defined the Zagreb radio indices based on the radio coloring of the vertices of a graph. As the indices in many cases are much larger than that of the first and second Zagreb indices and are closer to the forgotten topological index, they might help the QSAR studies of molecular graphs. Acknowledgement The authors would like to thank the referees for their valuable comments and corrections. References [1] G. Chartrand and P. Zhang, Chromatic Graph Theory, CRC, (008). [] G. H. Fath-Tabar, Old and New Zagreb Indices of Graphs, MATCH Commun. Math. Comput. Chem., 5 (011), [3] C. Fernandez et al., The Radio Number of Gear Graphs, arxiv preprint arxiv:0809.3, (008). 350
9 Zagreb Radio Indices of Graphs 9 [4] J. A. Gallian, A Dynamic Survey of Graph Labeling, The Electron. J. Combin., DS, (01), [5] I. Gutman, Degree-Based Topological Indices, Croat. Chem. Acta, 8 (013), [] I. Gutman, On the origin of two degree-based topological indices, Bull. Acad. Serbe Sci. Arts (Cl. Sci. Math. Natur.) 14 (014), [7] I. Gutman and N. Trinajstic, Graph theory and molecular orbitas. Total π- electron energy of alternant hydrocarbons, Chem. Phys. Lett.17 (197), [8] W. K. Hale, Frequency assignment, theory and application, Bull. Inst. Combin. Appl., 43 (005), [9] J. V. D Heuvel and M. A. Shepherd, Graph labeling and radio channel assignment, J. Graph Theory, 9 (1998), [10] I. Z. Milovanovic et al., Some Inequalities for the Forgotten Topological Index, Int. J. Appl. Graph Theory, 1 (017), [11] R. Natarajan et al., Applications of Topological Indices to Structure-Activity Relationship Modelling and Selection of Mineral Collectors, Indian Journal of Chemistry, 4 (003),
10 35
F-INDEX AND COINDEX OF SOME DERIVED GRAPHS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 8(2018), 81-88 DOI: 10.7251/BIMVI1801081D Former BULLETIN OF
More informationRadio Number of Cycles and their Total Graphs
Available online at www.worldscientificnews.com WSN 101 (2018) 55-64 EISSN 2392-2192 Radio Number of Cycles and their Total Graphs E. T. Merlin 1, Tabitha Agnes Mangam 2 Department of Mathematics, CHRIST
More informationUniversity of Education Lahore, PAKISTAN 2 Divisional Public School and College Sahiwal. PAKISTAN 3 Department of Mathematical Sciences
International Journal of Pure and Applied Mathematics Volume 118 No. 018, 413-417 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.173/ijpam.v118i.4
More informationVERTEX-DEGREE-BASED TOPOLOGICAL INDICES OVER TREES WITH TWO BRANCHING VERTICES
Kragujevac Journal of Mathematics Volume 43(3) (019), Pages 399 411. VERTEX-DEGREE-BASED TOPOLOGICAL INDICES OVER TREES WITH TWO BRANCHING VERTICES R. CRUZ 1, C. A. MARÍN 1, AND J. RADA 1 Abstract. Given
More informationOn the F-index and F-coindex of the line graphs of the subdivision graphs
Malaya Journal of Matematik, Vol. 6, No., 6-68, 018 https://doi.org/10.667/mjm060/0010 On the F-index and F-coindex of the line graphs of the subdivision graphs Ruhul Amin1 and Sk. Md. Abu Nayeem * Abstract
More informationDIAMETRAL PATHS IN TOTAL GRAPHS OF COMPLETE GRAPHS, COMPLETE BIPARTITE GRAPHS AND WHEELS
International Journal of Civil Engineering and Technology (IJCIET) Volume 8, Issue 5, May 017, pp. 11 119, Article ID: IJCIET_08_05_17 Available online at http://www.iaeme.com/ijciet/issues.asp?jtype=ijciet&vtype=8&itype=5
More informationOn the Wiener Index of Some Edge Deleted Graphs
Iranian Journal of Mathematical Sciences and Informatics Vol. 11, No. (016), pp 139-148 DOI: 10.7508/ijmsi.016.0.011 On the Wiener Index of Some Edge Deleted Graphs B. S. Durgi a,, H. S. Ramane b, P. R.
More informationOn Geometric Arithmetic Index of Graphs
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 64 2010) 619-630 ISSN 0340-6253 On Geometric Arithmetic Index of Graphs Kinkar Ch. Das Department of Mathematics,
More informationRadio Number for Special Family of Graphs with Diameter 2, 3 and 4
MATEMATIKA, 2015, Volume 31, Number 2, 121 126 c UTM Centre for Industrial and Applied Mathematics Radio Number for Special Family of Graphs with Diameter 2, 3 and 4 Murugan Muthali School of Science,
More informationExtremal chemical trees of the first reverse Zagreb beta index
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 5132, Online ISSN 2367 8275 Vol. 24, 2018, No. 4, 144 148 DOI: 10.7546/nntdm.2018.24.4.144-148 Extremal chemical trees of the first reverse
More informationOn Geometric-Arithmetic Indices of (Molecular) Trees, Unicyclic Graphs and Bicyclic Graphs
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 66 (20) 68-697 ISSN 0340-623 On Geometric-Arithmetic Indices of (Molecular) Trees, Unicyclic Graphs and
More informationRADIO LABELING OF SOME LADDER-RELATED GRAPHS
RADIO LABELING OF SOME LADDER-RELATED GRAPHS ALI AHMAD and RUXANDRA MARINESCU-GHEMECI Communicated by Ioan Tomescu Let d(u, v) denote the distance between two distinct vertices of a connected graph G,
More informationEccentric Connectivity Index, Hyper and Reverse-Wiener Indices of the Subdivision Graph
Gen. Math. Notes, Vol., No., February 011, pp.4-46 ISSN 19-7184; Copyright c ICSRS Publication, 011 www.i-csrs.org Available free online at http://www.geman.in Eccentric Connectivity Index, Hyper and Reverse-Wiener
More informationGraceful and odd graceful labeling of graphs
International Journal of Mathematics and Soft Computing Vol.6, No.2. (2016), 13-19. ISSN Print : 2249 3328 ISSN Online: 2319 5215 Graceful and odd graceful labeling of graphs Department of Mathematics
More informationSOME VARIANTS OF THE SZEGED INDEX UNDER ROOTED PRODUCT OF GRAPHS
Miskolc Mathematical Notes HU e-issn 1787-1 Vol. 17 (017), No., pp. 761 775 DOI: 10.1851/MMN.017. SOME VARIANTS OF THE SZEGED INDE UNDER ROOTED PRODUCT OF GRAPHS MAHDIEH AZARI Received 10 November, 015
More informationThe Szeged, vertex PI, first and second Zagreb indices of corona product of graphs
Filomat 26:3 (2012), 467 472 DOI 10.2298/FIL1203467Y Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat The Szeged, vertex PI, first
More informationCLASSES OF VERY STRONGLY PERFECT GRAPHS. Ganesh R. Gandal 1, R. Mary Jeya Jothi 2. 1 Department of Mathematics. Sathyabama University Chennai, INDIA
Inter national Journal of Pure and Applied Mathematics Volume 113 No. 10 2017, 334 342 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Abstract: CLASSES
More informationProduct Cordial Labeling for Some New Graphs
www.ccsenet.org/jmr Journal of Mathematics Research Vol. 3, No. ; May 011 Product Cordial Labeling for Some New Graphs S K Vaidya (Corresponding author) Department of Mathematics, Saurashtra University
More informationSuper vertex Gracefulness of Some Special Graphs
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 11, Issue 3 Ver. V (May - Jun. 2015), PP 07-15 www.iosrjournals.org Super vertex Gracefulness of Some Special Graphs N.Murugesan
More informationGracefulness of a New Class from Copies of kc 4 P 2n and P 2 * nc 3
International Journal of Fuzzy Mathematics and Systems. ISSN 2248-9940 Volume 2, Number 1 (2012), pp. 75-81 Research India Publications http://www.ripublication.com Gracefulness of a New Class from Copies
More informationPROPERLY EVEN HARMONIOUS LABELINGS OF DISJOINT UNIONS WITH EVEN SEQUENTIAL GRAPHS
Volume Issue July 05 Discrete Applied Mathematics 80 (05) PROPERLY EVEN HARMONIOUS LABELINGS OF DISJOINT UNIONS WITH EVEN SEQUENTIAL GRAPHS AUTHORS INFO Joseph A. Gallian*, Danielle Stewart Department
More informationSome bounds on chromatic number of NI graphs
International Journal of Mathematics and Soft Computing Vol.2, No.2. (2012), 79 83. ISSN 2249 3328 Some bounds on chromatic number of NI graphs Selvam Avadayappan Department of Mathematics, V.H.N.S.N.College,
More informationON THE SUM OF THE SQUARES OF ALL DISTANCES IN SOME GRAPHS
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N. 38 017 (137 144) 137 ON THE SUM OF THE SQUARES OF ALL DISTANCES IN SOME GRAPHS Xianya Geng Zhixiang Yin Xianwen Fang Department of Mathematics and Physics
More information[Mahanta, 5(11): November 2018] ISSN DOI /zenodo Impact Factor
GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES REDUCED FIRST ZAGREB INDEX, REDUCED SECOND ZAGREB INDEX AND HYPER-ZAGREB INDEX OF FOUR NEW SUMS BASED ON TENSOR PRODUCT OF GRAPHS Abhigyan Mahanta *1,
More informationA Note On The Sparing Number Of The Sieve Graphs Of Certain Graphs
Applied Mathematics E-Notes, 15(015), 9-37 c ISSN 1607-510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ A Note On The Sparing Number Of The Sieve Graphs Of Certain Graphs Naduvath
More informationDO NOT RE-DISTRIBUTE THIS SOLUTION FILE
Professor Kindred Math 104, Graph Theory Homework 3 Solutions February 14, 2013 Introduction to Graph Theory, West Section 2.1: 37, 62 Section 2.2: 6, 7, 15 Section 2.3: 7, 10, 14 DO NOT RE-DISTRIBUTE
More informationWiener, Szeged Indices of Hexabenzocoronene
Volume 19 No. 8 216, 91-98 ISSN: 1311-88 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Wiener, Szeged Indices of Hexabenzocoronene Jasintha Quadras 1 K. Arputha
More informationChromatic Zagreb Indices for Graphical Embodiment of Colour Clusters
Chromatic Zagreb Indices for Graphical Embodiment of Colour Clusters Johan Kok arxiv:1611.01416v1 [math.gm] 1 Nov 016 Tshwane Metropolitan Police Department, City of Tshwane, South Africa kokkiek@tshwane.gov.za
More informationON WIENER INDEX OF GRAPH COMPLEMENTS. Communicated by Alireza Abdollahi. 1. Introduction
Transactions on Combinatorics ISSN (print): 51-8657, ISSN (on-line): 51-8665 Vol. 3 No. (014), pp. 11-15. c 014 University of Isfahan www.combinatorics.ir www.ui.ac.ir ON WIENER INDEX OF GRAPH COMPLEMENTS
More informationPrime Labeling for Some Cycle Related Graphs
Journal of Mathematics Research ISSN: 1916-9795 Prime Labeling for Some Cycle Related Graphs S K Vaidya (Corresponding author) Department of Mathematics, Saurashtra University Rajkot 360 005, Gujarat,
More informationMultiplicative Sum Zagreb Index of Splice, Bridge, and Bridge-Cycle Graphs
Bol. Soc. Paran. Mat. (3s.) v. 00 0 (0000):????. c SPM ISSN-2175-1188 on line ISSN-00378712 in press SPM: www.spm.uem.br/bspm doi:10.5269/bspm.40503 Multiplicative Sum Zagreb Index of Splice, Bridge, and
More informationAverage D-distance Between Edges of a Graph
Indian Journal of Science and Technology, Vol 8(), 5 56, January 05 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 OI : 07485/ijst/05/v8i/58066 Average -distance Between Edges of a Graph Reddy Babu
More informationOn Balance Index Set of Double graphs and Derived graphs
International Journal of Mathematics and Soft Computing Vol.4, No. (014), 81-93. ISSN Print : 49-338 ISSN Online: 319-515 On Balance Index Set of Double graphs and Derived graphs Pradeep G. Bhat, Devadas
More informationLOCAL CONNECTIVE CHROMATIC NUMBER OF DIRECT PRODUCT OF PATHS AND CYCLES
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 303-4874, ISSN (o) 303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(017), 561-57 DOI: 10.751/BIMVI1703561Ç Former BULLETIN OF THE
More informationAMO - Advanced Modeling and Optimization, Volume 16, Number 2, 2014 PRODUCT CORDIAL LABELING FOR SOME BISTAR RELATED GRAPHS
AMO - Advanced Modeling and Optimization, Volume 6, Number, 4 PRODUCT CORDIAL LABELING FOR SOME BISTAR RELATED GRAPHS S K Vaidya Department of Mathematics, Saurashtra University, Rajkot-6 5, GUJARAT (INDIA).
More informationOn the Zagreb Indices of Semi total Point Graphs of Some Graphs
Annals of Pure and Applied athematics Vol. 1, No. 1, 016, 49-57 ISSN: 79-087X (P), 79-0888(online) Published on 5 July 016 www.researchmathsci.org Annals of On the Zagreb Indices of Semi total Point Graphs
More informationAVERAGE D-DISTANCE BETWEEN VERTICES OF A GRAPH
italian journal of pure and applied mathematics n. 33 2014 (293 298) 293 AVERAGE D-DISTANCE BETWEEN VERTICES OF A GRAPH D. Reddy Babu Department of Mathematics Koneru Lakshmaiah Education Foundation (K.L.
More informationPAijpam.eu TOTAL CO-INDEPENDENT DOMINATION OF JUMP GRAPH
International Journal of Pure and Applied Mathematics Volume 110 No. 1 2016, 43-48 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.12732/ijpam.v110i1.4
More informationL (d, 2, 1) Labeling of Helm graph
Global Journal of Mathematical Sciences: Theory and Practical. ISSN 0974-3200 Volume 7, Number 1 (2015), pp. 45-52 International Research Publication House http://www.irphouse.com L (d, 2, 1) Labeling
More informationVariation of Graceful Labeling on Disjoint Union of two Subdivided Shell Graphs
Annals of Pure and Applied Mathematics Vol. 8, No., 014, 19-5 ISSN: 79-087X (P), 79-0888(online) Published on 17 December 014 www.researchmathsci.org Annals of Variation of Graceful Labeling on Disjoint
More informationThe Restrained Edge Geodetic Number of a Graph
International Journal of Computational and Applied Mathematics. ISSN 0973-1768 Volume 11, Number 1 (2016), pp. 9 19 Research India Publications http://www.ripublication.com/ijcam.htm The Restrained Edge
More informationThe Structural Properties of Central Graph of Sun Graphs
Volume 116 No. 12 2017, 147-155 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.12732/ijpam.v116i12.16 THE ACHROMATIC AND B-CHROMATIC NUMBER OF SUN
More informationTriple Connected Domination Number of a Graph
International J.Math. Combin. Vol.3(2012), 93-104 Triple Connected Domination Number of a Graph G.Mahadevan, Selvam Avadayappan, J.Paulraj Joseph and T.Subramanian Department of Mathematics Anna University:
More informationarxiv: v1 [cs.dm] 10 Sep 2018
Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices Gauvain Devillez 1, Alain Hertz 2, Hadrien Mélot 1, Pierre Hauweele 1 1 Computer Science Department
More informationOn the Graceful Cartesian Product of Alpha-Trees
Theory and Applications of Graphs Volume 4 Issue 1 Article 3 017 On the Graceful Cartesian Product of Alpha-Trees Christian Barrientos Clayton State University, chr_barrientos@yahoo.com Sarah Minion Clayton
More informationS. K. Vaidya and Rakhimol V. Isaac
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(2015), 191-195 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS
More informationRadio mean labeling of Path and Cycle related graphs
Global Journal of Mathematical Sciences: Theory and Practical. ISSN 0974-300 Volume 9, Number 3 (017), pp. 337-345 International Research Publication House http://www.irphouse.com Radio mean labeling of
More informationAnalysis of Some Bistar Related MMD Graphs
Volume 118 No. 10 2018, 407-413 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.12732/ijpam.v118i10.41 ijpam.eu Analysis of Some Bistar Related MMD
More informationProduct Cordial Labeling of Some Cycle Related Graphs
Product Cordial Labeling of Some Cycle Related Graphs A. H. Rokad 1, G. V. Ghodasara 2 1 PhD Scholar, School of Science, RK University, Rajkot - 360020, Gujarat, India 2 H. & H. B. Kotak Institute of Science,
More informationPrime Labeling For Some Octopus Related Graphs
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 12, Issue 6 Ver. III (Nov. - Dec.2016), PP 57-64 www.iosrjournals.org Prime Labeling For Some Octopus Related Graphs A.
More informationStrong Triple Connected Domination Number of a Graph
Strong Triple Connected Domination Number of a Graph 1, G. Mahadevan, 2, V. G. Bhagavathi Ammal, 3, Selvam Avadayappan, 4, T. Subramanian 1,4 Dept. of Mathematics, Anna University : Tirunelveli Region,
More informationComplementary Acyclic Weak Domination Preserving Sets
International Journal of Research in Engineering and Science (IJRES) ISSN (Online): 30-9364, ISSN (Print): 30-9356 ijresorg Volume 4 Issue 7 ǁ July 016 ǁ PP 44-48 Complementary Acyclic Weak Domination
More informationarxiv: v4 [math.co] 4 Apr 2011
Upper-critical graphs (complete k-partite graphs) José Antonio Martín H. Faculty of Computer Science, Complutense University of Madrid, Spain arxiv:1011.4124v4 [math.co] 4 Apr 2011 Abstract This work introduces
More informationTotal magic cordial labeling and square sum total magic cordial labeling in extended duplicate graph of triangular snake
2016; 2(4): 238-242 ISSN Print: 2394-7500 ISSN Online: 2394-5869 Impact Factor: 5.2 IJAR 2016; 2(4): 238-242 www.allresearchjournal.com Received: 28-02-2016 Accepted: 29-03-2016 B Selvam K Thirusangu P
More informationOdd Harmonious Labeling of Some Graphs
International J.Math. Combin. Vol.3(0), 05- Odd Harmonious Labeling of Some Graphs S.K.Vaidya (Saurashtra University, Rajkot - 360005, Gujarat, India) N.H.Shah (Government Polytechnic, Rajkot - 360003,
More information[Ramalingam, 4(12): December 2017] ISSN DOI /zenodo Impact Factor
GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES FORCING VERTEX TRIANGLE FREE DETOUR NUMBER OF A GRAPH S. Sethu Ramalingam * 1, I. Keerthi Asir 2 and S. Athisayanathan 3 *1,2 & 3 Department of Mathematics,
More informationVertex Odd Divisor Cordial Labeling for Vertex Switching of Special Graphs
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 9 (017), pp. 555 5538 Research India Publications http://www.ripublication.com/gjpam.htm Vertex Odd Divisor Cordial Labeling
More informationEnergy of Complete Fuzzy Labeling Graph through Fuzzy Complete Matching
Energy of Complete Fuzzy Labeling Graph through Fuzzy Complete Matching S. Yahya Mohamad #1, S.Suganthi *2 1 PG & Research Department of Mathematics Government Arts College, Trichy-22, Tamilnadu, India
More informationON LICT SIGRAPHS. Communicated by Dariush Kiani
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 4 (2014), pp. 11-18. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir ON LICT SIGRAPHS V. MATHAD
More informationEquitable Coloring on Triple Star Graph Families
International J.Math. Combin. Vol.2(2018), 24-32 Equitable Coloring on Triple Star Graph Families K.Praveena (Department of Computer Science, Dr.G.R. Damodaran College of Science, Coimbatore-641014, Tamilnadu,
More informationWeighted Peripheral Graph
Indian Journal of Science and Technology, Vol 9(6), DOI: 1017485/ijst/2016/v9i6/82458, February 2016 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 Weighted Peripheral Graph M Tabitha Agnes 1* and
More informationMath 170- Graph Theory Notes
1 Math 170- Graph Theory Notes Michael Levet December 3, 2018 Notation: Let n be a positive integer. Denote [n] to be the set {1, 2,..., n}. So for example, [3] = {1, 2, 3}. To quote Bud Brown, Graph theory
More informationNotes on Trees with Minimal Atom Bond Connectivity Index
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 67 (2012) 467-482 ISSN 0340-6253 Notes on Trees with Minimal Atom Bond Connectivity Index Ivan Gutman, Boris
More informationNEIGHBOURHOOD SUM CORDIAL LABELING OF GRAPHS
NEIGHBOURHOOD SUM CORDIAL LABELING OF GRAPHS A. Muthaiyan # and G. Bhuvaneswari * Department of Mathematics, Government Arts and Science College, Veppanthattai, Perambalur - 66, Tamil Nadu, India. P.G.
More informationChapter 4. square sum graphs. 4.1 Introduction
Chapter 4 square sum graphs In this Chapter we introduce a new type of labeling of graphs which is closely related to the Diophantine Equation x 2 + y 2 = n and report results of our preliminary investigations
More informationOn the Relationships between the First and Second Zagreb Indices
ATCH Communications in athematical and in Computer Chemistry ATCH Commun. ath. Comput. Chem. 68 (0) 69-88 ISSN 0340-653 On the Relationships between the First and Second Zagreb Indices Tamás Réti Széchenyi
More informationVertex Magic Total Labelings of Complete Graphs 1
Vertex Magic Total Labelings of Complete Graphs 1 Krishnappa. H. K. and Kishore Kothapalli and V. Ch. Venkaiah Centre for Security, Theory, and Algorithmic Research International Institute of Information
More informationλ -Harmonious Graph Colouring
λ -Harmonious Graph Colouring Lauren DeDieu McMaster University Southwestern Ontario Graduate Mathematics Conference June 4th, 201 What is a graph? What is vertex colouring? 1 1 1 2 2 Figure : Proper Colouring.
More informationTHE TOPOLOGICAL INDICES OF THE CAYLEY GRAPHS OF DIHEDRAL GROUP D 2n AND THE GENERALIZED QUATERNION GROUP Q 2 n
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N. 40 018 (44 433) 44 THE TOPOLOGICAL INDICES OF THE CAYLEY GRAPHS OF DIHEDRAL GROUP D n AND THE GENERALIZED QUATERNION GROUP Q n S. Shokrolahi Yancheshmeh
More informationSeema Mehra, Neelam Kumari Department of Mathematics Maharishi Dayanand University Rohtak (Haryana), India
International Journal of Scientific & Engineering Research, Volume 5, Issue 10, October-014 119 ISSN 9-5518 Some New Families of Total Vertex Product Cordial Labeling Of Graphs Seema Mehra, Neelam Kumari
More informationGraphs. Pseudograph: multiple edges and loops allowed
Graphs G = (V, E) V - set of vertices, E - set of edges Undirected graphs Simple graph: V - nonempty set of vertices, E - set of unordered pairs of distinct vertices (no multiple edges or loops) Multigraph:
More informationSOME NEW CLASSES OF GRACEFUL DIAMETER SIX TREES
TWMS J. App. Eng. Math. V.5, N., 5, pp. 69-. SOME NEW CLASSES OF GRACEFUL DIAMETER SIX TREES AMARESH CHANDRA PANDA, DEBDAS MISHRA, Abstract. Here we denote a diameter six tree by (a ; a, a,..., a m; b,
More informationTHE RESTRAINED EDGE MONOPHONIC NUMBER OF A GRAPH
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(1)(2017), 23-30 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS
More informationEdge-Odd Graceful Labeling for Sum of a Path and a Finite Path
Global Journal of Mathematical Sciences: Theory and Practical. ISSN 0974-3200 Volume 9, Number 3 (2017), pp. 323-335 International Research Publication House http://www.irphouse.com Edge-Odd Graceful Labeling
More informationPrime Labeling for Some Planter Related Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 8, Number 3 (2016), pp. 221-231 International Research Publication House http://www.irphouse.com Prime Labeling for Some Planter Related
More informationMean, Odd Sequential and Triangular Sum Graphs
Circulation in Computer Science Vol.2, No.4, pp: (40-52), May 2017 https://doi.org/10.22632/ccs-2017-252-08 Mean, Odd Sequential and Triangular Sum Graphs M. A. Seoud Department of Mathematics, Faculty
More informationInternational Journal of Pure and Applied Mathematics
Volume 115 No. 9 017, 363-375 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu EVEN VERTEX MAGIC TOTAL LABELING C.T. NAGARAJ Research Scholar, Department
More informationPAijpam.eu PRIME CORDIAL LABELING OF THE GRAPHS RELATED TO CYCLE WITH ONE CHORD, TWIN CHORDS AND TRIANGLE G.V. Ghodasara 1, J.P.
International Journal of Pure and Applied Mathematics Volume 89 No. 1 2013, 79-87 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v89i1.9
More informationEstrada Index. Bo Zhou. Augest 5, Department of Mathematics, South China Normal University
Outline 1. Introduction 2. Results for 3. References Bo Zhou Department of Mathematics, South China Normal University Augest 5, 2010 Outline 1. Introduction 2. Results for 3. References Outline 1. Introduction
More informationOn Cordial Labeling: Gluing of Paths and Quadrilateral Snake Graphs on Cycle Graph
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 12, Number 4 (2016), pp. 3559 3567 Research India Publications http://www.ripublication.com/gjpam.htm On Cordial Labeling: Gluing of
More informationChromatic Transversal Domatic Number of Graphs
International Mathematical Forum, 5, 010, no. 13, 639-648 Chromatic Transversal Domatic Number of Graphs L. Benedict Michael Raj 1, S. K. Ayyaswamy and I. Sahul Hamid 3 1 Department of Mathematics, St.
More informationSharp lower bound for the total number of matchings of graphs with given number of cut edges
South Asian Journal of Mathematics 2014, Vol. 4 ( 2 ) : 107 118 www.sajm-online.com ISSN 2251-1512 RESEARCH ARTICLE Sharp lower bound for the total number of matchings of graphs with given number of cut
More informationGeneralization of the degree distance of the tensor product of graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 63 015, Pages 11 7 Generalization of the degree distance of the tensor product of graphs K Pattabiraman P Kandan Department of Mathematics, Faculty of Engineering
More informationSome Strong Connectivity Concepts in Weighted Graphs
Annals of Pure and Applied Mathematics Vol. 16, No. 1, 2018, 37-46 ISSN: 2279-087X (P), 2279-0888(online) Published on 1 January 2018 www.researchmathsci.org DOI: http://dx.doi.org/10.22457/apam.v16n1a5
More informationBounds on distances for spanning trees of graphs. Mr Mthobisi Luca Ntuli
Bounds on distances for spanning trees of graphs Mr Mthobisi Luca Ntuli March 8, 2018 To Mphemba Legacy iii Acknowledgments I would like to thank my supervisors, Dr MJ Morgan and Prof S Mukwembi. It
More informationProperly even harmonious labelings of disconnected graphs
Available online at www.sciencedirect.com ScienceDirect AKCE International Journal of Graphs and Combinatorics 12 (2015) 193 203 www.elsevier.com/locate/akcej Properly even harmonious labelings of disconnected
More informationLOCAL CONNECTIVE CHROMATIC NUMBER OF CARTESIAN PRODUCT OF SOME GRAPHS
LOCAL CONNECTIVE CHROMATIC NUMBER OF CARTESIAN PRODUCT OF SOME GRAPHS ROMANIAN JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE, 08, VOLUME 8, ISSUE, p-7 CANAN C IFTC I AND PINAR DU NDAR Abstract A local connective
More informationMAXIMUM WIENER INDEX OF TREES WITH GIVEN SEGMENT SEQUENCE
MAXIMUM WIENER INDEX OF TREES WITH GIVEN SEGMENT SEQUENCE ERIC OULD DADAH ANDRIANTIANA, STEPHAN WAGNER, AND HUA WANG Abstract. A segment of a tree is a path whose ends are branching vertices (vertices
More informationOn vertex-coloring edge-weighting of graphs
Front. Math. China DOI 10.1007/s11464-009-0014-8 On vertex-coloring edge-weighting of graphs Hongliang LU 1, Xu YANG 1, Qinglin YU 1,2 1 Center for Combinatorics, Key Laboratory of Pure Mathematics and
More informationCommon Neighborhood Product of Graphs
Volume 114 No. 6 2017, 203-208 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Common Neighborhood Product of Graphs A Babu 1 and J Baskar Babujee
More informationEccentric Coloring of a Graph
Eccentric Coloring of a Graph Medha Itagi Huilgol 1 & Syed Asif Ulla S. 1 Journal of Mathematics Research; Vol. 7, No. 1; 2015 ISSN 1916-9795 E-ISSN 1916-909 Published by Canadian Center of Science and
More informationTHE INSULATION SEQUENCE OF A GRAPH
THE INSULATION SEQUENCE OF A GRAPH ELENA GRIGORESCU Abstract. In a graph G, a k-insulated set S is a subset of the vertices of G such that every vertex in S is adjacent to at most k vertices in S, and
More informationEquitable Colouring of Certain Double Vertex Graphs
Volume 118 No. 23 2018, 147-154 ISSN: 1314-3395 (on-line version) url: http://acadpubl.eu/hub ijpam.eu Equitable Colouring of Certain Double Vertex Graphs Venugopal P 1, Padmapriya N 2, Thilshath A 3 1,2,3
More informationNumber Theory and Graph Theory
1 Number Theory and Graph Theory Chapter 6 Basic concepts and definitions of graph theory By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com
More informationDouble Vertex Graphs and Complete Double Vertex Graphs. Jobby Jacob, Wayne Goddard and Renu Laskar Clemson University April, 2007
Double Vertex Graphs and Complete Double Vertex Graphs Jobby Jacob, Wayne Goddard and Renu Laskar Clemson University April, 2007 Abstract Let G = (V, E) be a graph of order n 2. The double vertex graph,
More informationDO NOT RE-DISTRIBUTE THIS SOLUTION FILE
Professor Kindred Math 104, Graph Theory Homework 2 Solutions February 7, 2013 Introduction to Graph Theory, West Section 1.2: 26, 38, 42 Section 1.3: 14, 18 Section 2.1: 26, 29, 30 DO NOT RE-DISTRIBUTE
More informationDetour Distance Sequence of Grid and Grid Derived Networks
Detour Distance Sequence of Grid and Grid Derived Networks S. Prabhu 1*, Y. Sherlin Nisha 2, K.S. Sudhakhar 3 1 Assistant Professor, Department of Applied Mathematics Sri Venkateswara College of Engineering
More informationarxiv: v1 [cs.dm] 22 Jul 2012
The total irregularity of a graph July 4, 0 Hosam Abdo, Darko Dimitrov arxiv:07.567v [cs.dm] Jul 0 Institut für Informatik, Freie Universität Berlin, Takustraße 9, D 495 Berlin, Germany E-mail: [abdo,darko]@mi.fu-berlin.de
More informationVertex-Colouring Edge-Weightings
Vertex-Colouring Edge-Weightings L. Addario-Berry a, K. Dalal a, C. McDiarmid b, B. A. Reed a and A. Thomason c a School of Computer Science, McGill University, University St. Montreal, QC, H3A A7, Canada
More informationGraceful Labeling for Cycle of Graphs
International Journal of Mathematics Research. ISSN 0976-5840 Volume 6, Number (014), pp. 173 178 International Research Publication House http://www.irphouse.com Graceful Labeling for Cycle of Graphs
More information