The PI Index of the Deficient Sunflowers Attached with Lollipops
|
|
- Oswald Barton
- 5 years ago
- Views:
Transcription
1 Int. J. Contemp. Math. Sciences, Vol. 6, 011, no. 41, The PI Index of the Deficient Sunflowers Attached with Lollipops Min Huang Institute of Mathematics Physics and Information Sciences Zhejiang Normal University Jinhua 31004, China Lili He Institute of Mathematics Physics and Information Sciences Zhejiang Normal University Jinhua 31004, China Abstract The Padmaar-Ivan (PI) index is a Wiener-Szeged-lie topological index which reflects certain structural features of organic molecules, in this paper we study the PI index of the deficient sunflowers attached with lollipops. Mathematics Subject Classification: 05C1, 05C90 Keywords: PI index, deficient sunflowers, lollipops 1 Introduction The topological index is introduced to reflect certain structural features of organic molecules in chemical graph theory. The topological indices based on the distance of vertexes in a graph have played an important role in describing molecular graph and establish the relationship between the structure of molecular and its features in chemistry theory. At the same time it was extensively used to predict the physical and chemical properties of compounds and their biological activity. The wiener index proposed by American chemist Wiener in 1947 was the first topological index proposed [1-]. It was used to investigate the relationship between the boiling point and its molecular structures of Alanes. Then P.V.Khadiar proposed another topological index: the
2 00 Min Huang and Lili He Padmaar-Ivan (PI) index [3] which has many superior properties to wiener index [4]. The PI index of a graph G is defined as follows: PI = PI(G) = [n eu (e G)+n ev (e G)], where for edge e = uv n eu (e G) is the number of edges of G lying closer to u than v, n ev (e G) is the number of edges of G lying closer to v than u and the summation goes over all edges of G. The edges which are equidistant from u and v are not considered for the calculation of PI index [5]. Preliminary Notes We called a vertex with degree a -vertex. For further details, please see [6]. Definition.1. [7]Suppose every edge of a cycle C ( 3)is adjacent with a triangle, every triangle except the cycle C has a -vetex, we called this graph a sunflower and is denoted by SF. All these triangles except C are called the petals of this sunflower, every petal has and only has one -vertex. Definition.. When we delete λ petals from SF, we obtain a new graph which is called deficient sunflower, denote it DSF,λ, where λ is the number of edges in C which are not adjacent to a triangle except C, we called λ the deficient value of DSF,λ. Obviously, 0 λ. Forv i v i+1 E(C ), suppose v i v i+1 is adjacent with a triangle v i v i+1 u i v i except C, we say there is a petal at edge v i v i+1. Definition.3. For the deficient sunflower DSF,λ, let all the vertex of C uniformly distributed on a cycle, draw a diameter through the midpoint of edge v i v i+1, when is odd, this diameter must pass through a vertex v j of C, we called this vertex v j the corresponding vertex of edge v i v i+1. Suppose v j is a -vertex, we say the corresponding vertex of edge v i v i+1 is a -vertex. Similarly we called the edge v i v i+1 the corresponding edge of vertex v j. When is even, this diameter must intersect with another edge v j v j+1 of C,wesayv j v j+1 the corresponding edge of edge v i v i+1. Definition.4. [8]Let C = v 1 v v v 1, P n = w 1 w w n. The lollipop L(n, ) is obtained by connecting v 1 and w 1 with an edge v 1 w 1, where n>. Definition.5. Attaching a lollipop graph L(n i, i ) to each vertex v i of cycle C in DSF,λ and mae the vertex v i coincide with the vertex w ni i in L(n i, i ), attaching a lollipop graphl(n i, i ) to each -vetex u i of a petal and mae the vertex u i coincide with the vertex w ni i, we get a deficient sunflower attached with lollipops and is denoted by LDSF,λ.
3 PI index of deficient sunflowers 003 We use (H) to express the contributions of edges in subgraph H of G to the PI index of graph G and use Δ i to express the triangle v i v i+1 u i v i which is adjacent with the edge v i v i+1 of C. If there is a deficit at the edge of v i v i+1, Δ i degenerate into an edge, then the contribution of Δ i to the PI index of graph G equals to the contribution of edge v i v i+1 to the PI index of graph G. 3 Main Results These are the main results of the paper. Lemma 3.1. [9]Let T n be a tree with n vertices, n, we have PI(T n )= (n 1)(n ). Lemma 3.. [9]Let C n be a cycle with n vertices, we have { n(n 1), n is odd; PI(C n )= n(n ), n is even. Theorem 3.3. Let G be a graph with n vertices u 1, u,..., u n. We define G as follows: attaching the end vertex w ni i of the lollipops graph L(n i, i ) to the vertex u i, where,,..., n. We have PI(G )= n (L(n i, i )) + PI(G)+N E(G) (m 1 n 1 + m n + + m n n n ) where N = n 1 + n + + n n,{ m i = {xy E(G) d(x, u i )=d(y, u i )}, t = (ni 1)(t 1) + ( E(G) + N, (L(n i, i )) = i 1), i is odd; n i (t 1) i, i is even. Proof. Obviously, when i is odd (L(n i, i )) = (n i 1)(t 1) + ( i 1). When i is even (L(n i, i )) = i (t ) + (n i i )(t 1) = n i (t 1) i. And because (G) =PI(G)+N E(G) (m 1 n 1 + m n + + m n n n ). The theorem follows.
4 004 Min Huang and Lili He Theorem 3.4. When is even, we have PI(DSF,λ )=6 7λ +λ λ. When is odd, let the corresponding vertex of edge v i v i+1 be v j, we have PI(DSF,λ )=6 7λ +λ + λ d(v j ), where d(v j ) is the degree of vertex v j in DSF,λ. Proof. Let x = E(DSF,λ ) =3 λ Case 1. Let be even Subcase 1.1. Δ i is a degenerate triangle. The corresponding edge v i+ v i+1+ v i and v i+1. Other edges except v i v i+1 and v i+,,,; no petal at v i v i+1 of edge v i v i+1 would be equidistant from are not equidistant from v i v i+1+ and v i+1. Thus, the contribution of edge v i v i+1 to PI(DSF,λ )isx. Subcase 1.. Δ i is a non-degenerate triangle. Let Δ i be v i v i+1 u i v i, the corresponding edge of edge v i v i+1 be v j v j+1. Similar to Subcase 1.1, the contribution of v i v i+1 to PI(DSF,λ )isx. edge v i v i+1, we have d(u i,v i )=d(v i+1,v i ), For d(u i,v i 1 )=d(v i+1,v i 1 ), d(u i,v j+1 )=d(v i+1,v j+1 ), d(u i,v j ) >d(v i+1,v j ), d(u i,v j 1 ) >d(v i+1,v j 1 ), d(u i,v i+ ) >d(v i+1,v i+ ). Hence, the edges whose two ends are in set {v i,u i 1,v i 1,,v j+1,u j } are equidistant from v i+1 and u i. The remaining edges are not equidistant from
5 PI index of deficient sunflowers 005 v i+1 and u i. For edge u i v i, we have similar results. Hence, the contributions of edges in Δ i to PI(DSF,λ ) are x. The first half part of the theorem follows. Case. Let be odd Subcase.1. Δ i is a degenerate triangle. Let the corresponding vertex of edge v i v i+1 be v j. Clearly, d(v i,v j )=d(v i+1, v j ). If there existed {u j 1,u j } V(DSF,λ ), edges v j u j 1 and v j u j would be equidistant from v i and v i+1 respectively. Similarly, the edges except v j u j 1, v j u j and v i v i+1 are not equidistant from v i and v i+1. Hence, the contribution of edge in a degenerate triangle to PI(DSF,λ ) isx d(v j ) + 1. There are all λ degenerate triangles. Subcase.. Δ i is a non-degenerate triangle. Let Δ i be v i v i+1 u i v i, the corresponding vertex of edge v i v i+1 be v j. When d(v i ) = 4, similar to Subcase.1 we have the contribution of edge v i v i+1 to PI(DSF,λ )isx d(v j )+1. For edge u i v i+1, similar to Subcase 1. we now the edges whose two ends are in set {v i,u i 1,v i 1, v j+1,u j,v j } except v j u j are equidistant from v i+1 and u i, the remaining edges except u i v i+1 are not equidistant from v i+1 and u i. For edge u i v i, we have similar results. Hence, the sum of the contributions of edges u i v i and u i v i+1 to PI(DSF,λ ) equals x + d(v j ) 1. Thus, the contributions of edges in Δ i to PI(DSF,λ ) are x. When d(v i )= 3 and d(v i ) =, we can discuss similarly. Hence, PI(DSF,λ )=x( λ)+ (x d(v j )+1),,,; no petal at v i v i+1 Substitute 3 λ to x. The theorem follows. For the deficient sunflower attached with lollipops LDSF,λ defined in definition.5, in the following let N =(n 1 +n + +n )+(n 1 +n + +n ), x = E(DSF,λ ) =3 λ, t = x + N. Theorem 3.5. Let S = { i i is odd} { i i is odd}, P = i is even i + i, Q = i + i, PI(DSF,λ ) is provided by Theorem i is even i is odd i is odd 3.. When is odd, let the corresponding edge of vertex v i be v j v j+1 and T =( λ)n n i.,,,; no petal at v j v j+1 When is even, let the corresponding edge of edge v i v i+1 be v j v j+1 and T =( λ)n n i.,,,; no petal at v j v j+1
6 006 Min Huang and Lili He We have PI(LDSF,λ )=Q ts P +(t 1)N + PI(DSF,λ )+T. Proof. Let M = Q S, M = P (t ), M =(t 1)(N S P ). Claim 1. PI LDSF,λ [L(n i, i )] + PI LDSF,λ [L(n i, i )] = M + M + M In fact, we can classify all the edges of lollipops L(n i, i ) and L(n i, i ) in LDSF,λ into three classes according to their contributions to LDSF,λ. If i (or i ) is odd, the contribution of the corresponding edge of vertex w 1 in C i (or C i )to PI(LDSF,λ )is i 1(or i 1). All these edges are in the first class.the sum of the contributions of all these edges to PI(LDSF,λ ) are i is odd ( i 1) + i is odd ( i 1) = M. If i (or i ) is even, the contribution of every edge in C i (or C i )topi(ldsf,λ ) is t. All these edges are in the second class. The sum of the contributions of all these edges to PI(LDSF,λ ) are (t )( i is even i + i is even i )=M. The other edges except the edges in class one and class two are in the third class. Each of them has t 1 contribution to PI(LDSF,λ ). The sum of the contributions of all these edges to PI(LDSF,λ ) are (t 1)[N S ( i is even i + i is even i )] = M. Thus Claim 1 follows. Claim. Let m i and m i be defined in Theorem 3.1. When is odd, let the corresponding edge of vertex v i be v j v j+1, we have m i = λ; m i = λ if there is a petal at v j v j+1, m i = λ + 1 if there is no petal at v j v j+1. When is even, let the corresponding edge of edge v i v i+1 be v j v j+1, we have m i = λ ; m i =0ifn i =0,m i = λ if n i > 0 and there is a petal at v j v j+1, m i = λ +1ifn i > 0 and there is no petal at v j v j+1. In fact, we can prove Claim as follows: Case.1. is odd.
7 PI index of deficient sunflowers 007 For the vertex u i V (DSF,λ ), there existed one and only one edge in each petal whose two ends are equidistant from u i.thusm i = λ. For the vertex v i V (DSF,λ ), clearly, d(v j,v i )=d(v j+1,v i ). Other petals except the one at v j v j+1 have and only have one edge whose two ends are equidistant from v i. Case.. is even. We can get the conclusion similar to Case.1. Thus, Claim follows. By Theorem 3.1 the theorem follows. References [1] H Wiener. Structural determination of paraffin boiling points, J. Am. Chem. Soc,69 (1949), [] H Wiener. Co-relation: a heat of isomerization and differences in heats of vaporization of isomers, among the paraffin hydrocarbons, J. Am. Chem. Soc,69 (1947), [3] P. V. Khadiar. on a novel structural descriptor PI, Nat. Acad. Sci. Lett,3 (000), [4] M. Jaiswal, P. V. Khadiar. QSAR study on tadpole narcosis using PI index: a case of hetergenous set of compounds, Biorg. Med. Chem Soc,1 (004), [5] P. E. John, P. V. Khadiar, J.Singh. A method of computing the PI index of benzenoid hydrocarbons using orthogonal cuts, J. Math. Chem,4 (006), [6] J. A. Bondy, U. S. R. Murty. Graph Theory with Applications, Macmillan Press Ltd, London, [7] Oleg V. Borodin, Anna O. Ivanova. Planar graphs decomposable into a forest and a matching, Discrete Mathematics,309 (009), [8] Junfeng Li, Fangli Xia. The degree distance of a class of unicyclic graph, Journal of Hunan University of Technologies, (010), 1-3. [9] P. V. Khadiar, S. Karmarar, V. K. Agrawal. A novel PI index and its applications to QSPR/QSAR studies, J. Chem. Inf. Comput. Sci,41 (001), Received: May, 011
The Eccentric Connectivity Index of Dendrimers
Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 45, 2231-2236 The Eccentric Connectivity Index of Dendrimers Jianguang Yang and Fangli Xia Department of Mathematics, Hunan City University Yiyang, Hunan
More informationA Method of Calculating the Edge Szeged Index of Hexagonal Chain
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 68 (2012) 91-96 ISSN 0340-6253 A Method of Calculating the Edge Szeged Index of Hexagonal Chain Shouzhong
More informationTopological indices: the modified Schultz index
Topological indices: the modified Schultz index Paula Rama (1) Joint work with Paula Carvalho (1) (1) CIDMA - DMat, Universidade de Aveiro The 3rd Combinatorics Day - Lisboa, March 2, 2013 Outline Introduction
More informationThe smallest Randić index for trees
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 123, No. 2, May 2013, pp. 167 175. c Indian Academy of Sciences The smallest Randić index for trees LI BINGJUN 1,2 and LIU WEIJUN 2 1 Department of Mathematics,
More informationOn the difference between the revised Szeged index and the Wiener index
On the difference between the revised Szeged index and the Wiener index Sandi Klavžar a,b,c M J Nadjafi-Arani d June 3, 01 a Faculty of Mathematics and Physics, University of Ljubljana, Slovenia sandiklavzar@fmfuni-ljsi
More informationSome Bounds on General Sum Connectivity Index
Some Bounds on General Sum Connectivity Index Yun Gao Department of Editorial, Yunnan Normal University, Kunming 65009, China, gy6gy@sinacom Tianwei Xu, Li Liang, Wei Gao School of Information Science
More informationTHE REVISED EDGE SZEGED INDEX OF BRIDGE GRAPHS
Hacettepe Journal of Mathematics and Statistics Volume 1 01 559 566 THE REVISED EDGE SZEGED INDEX OF BRIDGE GRAPHS Hui Dong and Bo Zhou Received 01:09:011 : Accepted 15:11:011 e=uv EG Abstract The revised
More informationThe Degree Distance of Armchair Polyhex Nanotubes
Applied Mathematical Sciences, Vol. 5, 20, no. 6, 26-266 The Degree Distance of Armchair Polyhe Nanotubes Shubo Chen, Jianguang Yang, Fangli Xia and Qiao Chen Department of Mathematics, Hunan City University,
More informationExtremal Kirchhoff index of a class of unicyclic graph
South Asian Journal of Mathematics 01, Vol ( 5): 07 1 wwwsajm-onlinecom ISSN 51-15 RESEARCH ARTICLE Extremal Kirchhoff index of a class of unicyclic graph Shubo Chen 1, Fangli Xia 1, Xia Cai, Jianguang
More informationExtremal Zagreb Indices of Graphs with a Given Number of Cut Edges
Graphs and Combinatorics (2014) 30:109 118 DOI 10.1007/s00373-012-1258-8 ORIGINAL PAPER Extremal Zagreb Indices of Graphs with a Given Number of Cut Edges Shubo Chen Weijun Liu Received: 13 August 2009
More informationTHE EDGE VERSIONS OF THE WIENER INDEX
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 61 (2009) 663-672 ISSN 0340-6253 THE EDGE VERSIONS OF THE WIENER INDEX Ali Iranmanesh, a Ivan Gutman, b
More informationON GLOBAL DOMINATING-χ-COLORING OF GRAPHS
- TAMKANG JOURNAL OF MATHEMATICS Volume 48, Number 2, 149-157, June 2017 doi:10.5556/j.tkjm.48.2017.2295 This paper is available online at http://journals.math.tku.edu.tw/index.php/tkjm/pages/view/onlinefirst
More informationCCO Commun. Comb. Optim.
Communications in Combinatorics and Optimization Vol. 3 No., 018 pp.179-194 DOI: 10.049/CCO.018.685.109 CCO Commun. Comb. Optim. Leap Zagreb Indices of Trees and Unicyclic Graphs Zehui Shao 1, Ivan Gutman,
More informationarxiv: v1 [math.co] 5 Sep 2016
Ordering Unicyclic Graphs with Respect to F-index Ruhul Amin a, Sk. Md. Abu Nayeem a, a Department of Mathematics, Aliah University, New Town, Kolkata 700 156, India. arxiv:1609.01128v1 [math.co] 5 Sep
More informationarxiv: v1 [math.co] 17 Apr 2018
On extremal cacti with respect to the edge revised Szeged index arxiv:180.06009v1 [math.co] 17 Apr 2018 Shengjie He a, Rong-Xia Hao a, Deming Li b a Department of Mathematics, Beijing Jiaotong University,
More informationRelation Between Randić Index and Average Distance of Trees 1
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 66 (011) 605-61 ISSN 0340-653 Relation Between Randić Index and Average Distance of Trees 1 Marek Cygan,
More informationDiscrete Mathematics
Discrete Mathematics 3 (0) 333 343 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc The Randić index and the diameter of graphs Yiting Yang a,
More informationWIENER POLARITY INDEX OF QUASI-TREE MOLECULAR STRUCTURES
Open J. Math. Sci., Vol. (018), No.1, pp. 7-8 ISSN 5-01 Website: http://www.openmathscience.com WIENER POLARITY INDEX OF QUASI-TREE MOLECULAR STRUCTURES ZIHAO TANG, LI LIANG 1, WEI GAO Abstract. As an
More informationOn the harmonic index of the unicyclic and bicyclic graphs
On the harmonic index of the unicyclic and bicyclic graphs Yumei Hu Tianjin University Department of Mathematics Tianjin 30007 P. R. China huyumei@tju.edu.cn Xingyi Zhou Tianjin University Department of
More informationCCO Commun. Comb. Optim.
Communications in Combinatorics and Optimization Vol. 1 No. 2, 2016 pp.137-148 DOI: 10.22049/CCO.2016.13574 CCO Commun. Comb. Optim. On trees and the multiplicative sum Zagreb index Mehdi Eliasi and Ali
More informationOn the Randić index. Huiqing Liu. School of Mathematics and Computer Science, Hubei University, Wuhan , China
Journal of Mathematical Chemistry Vol. 38, No. 3, October 005 ( 005) DOI: 0.007/s090-005-584-7 On the Randić index Huiqing Liu School of Mathematics and Computer Science, Hubei University, Wuhan 43006,
More informationDiscrete Applied Mathematics
iscrete Applied Mathematics 57 009 68 633 Contents lists available at Scienceirect iscrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam On reciprocal complementary Wiener number Bo
More informationRELATION BETWEEN WIENER INDEX AND SPECTRAL RADIUS
Kragujevac J. Sci. 30 (2008) 57-64. UDC 541.61 57 RELATION BETWEEN WIENER INDEX AND SPECTRAL RADIUS Slavko Radenković and Ivan Gutman Faculty of Science, P. O. Box 60, 34000 Kragujevac, Republic of Serbia
More informationWiener Index of Graphs and Their Line Graphs
JORC (2013) 1:393 403 DOI 10.1007/s40305-013-0027-6 Wiener Index of Graphs and Their Line Graphs Xiaohai Su Ligong Wang Yun Gao Received: 9 May 2013 / Revised: 26 August 2013 / Accepted: 27 August 2013
More informationHexagonal Chains with Segments of Equal Lengths Having Distinct Sizes and the Same Wiener Index
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 78 (2017) 121-132 ISSN 0340-6253 Hexagonal Chains with Segments of Equal Lengths Having Distinct Sizes and
More informationOn the Randić Index of Polyomino Chains
Applied Mathematical Sciences, Vol. 5, 2011, no. 5, 255-260 On the Randić Index of Polyomino Chains Jianguang Yang, Fangli Xia and Shubo Chen Department of Mathematics, Hunan City University Yiyang, Hunan
More informationPredicting Some Physicochemical Properties of Octane Isomers: A Topological Approach Using ev-degree. Süleyman Ediz 1
Predicting Some Physicochemical Properties of Octane Isomers: A Topological Approach Using ev-degree and ve-degree Zagreb Indices Süleyman Ediz 1 Received: 30 November 2016 Abstract Topological indices
More informationKeywords: Szeged index, TUAC 6 [ p, k ] Nanotube
Szeged Index of armchair polyhex Nanotube A. Iranmanesh * and Y. Pakravesh Department of Mathematice, Tarbiat Modares Universiry P. O. Box: 45-37, Tehran, Iran iranmana@modares.ac.ir Abstract Topological
More informationEquitable list colorings of planar graphs without short cycles
Theoretical Computer Science 407 (008) 1 8 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Equitable list colorings of planar graphs
More informationSOME VERTEX-DEGREE-BASED TOPOLOGICAL INDICES UNDER EDGE CORONA PRODUCT
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N. 38 07 8 9 8 SOME VERTEX-DEGREE-BASED TOPOLOGICAL INDICES UNDER EDGE CORONA PRODUCT I. Rezaee Abdolhosseinzadeh F. Rahbarnia M. Tavaoli Department of Applied
More informationComputing distance moments on graphs with transitive Djoković-Winkler s relation
omputing distance moments on graphs with transitive Djoković-Winkler s relation Sandi Klavžar Faculty of Mathematics and Physics University of Ljubljana, SI-000 Ljubljana, Slovenia and Faculty of Natural
More informationPredicting Some Physicochemical Properties of Octane Isomers: A Topological Approach Using ev-degree and ve-degree Zagreb Indices
International Journal of Systems Science and Applied Mathematics 2017; 2(5): 87-92 http://www.sciencepublishinggroup.com/j/ijssam doi: 10.11648/j.ijssam.20170205.12 ISSN: 2575-5838 (Print); ISSN: 2575-5803
More informationSome results on the reciprocal sum-degree distance of graphs
J Comb Optim (015) 30:435 446 DOI 10.1007/s10878-013-9645-5 Some results on the reciprocal sum-degree distance of graphs Guifu Su Liming Xiong Xiaofeng Su Xianglian Chen Published online: 17 July 013 The
More informationCalculating the hyper Wiener index of benzenoid hydrocarbons
Calculating the hyper Wiener index of benzenoid hydrocarbons Petra Žigert1, Sandi Klavžar 1 and Ivan Gutman 2 1 Department of Mathematics, PEF, University of Maribor, Koroška 160, 2000 Maribor, Slovenia
More informationTHE HARMONIC INDEX OF UNICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER
Kragujevac Journal of Mathematics Volume 38(1 (2014, Pages 173 183. THE HARMONIC INDEX OF UNICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER JIAN-BO LV 1, JIANXI LI 1, AND WAI CHEE SHIU 2 Abstract. The harmonic
More informationTHE HOSOYA INDEX AND THE MERRIFIELD-SIMMONS INDEX OF SOME GRAPHS. Communicated by Alireza Ashrafi. 1. Introduction
Transactions on Combinatorics ISSN (print): 51-8657, ISSN (on-line): 51-8665 Vol 1 No (01), pp 51-60 c 01 University of Isfahan wwwcombinatoricsir wwwuiacir THE HOSOYA INDEX AND THE MERRIFIELD-SIMMONS
More informationExtremal Graphs with Respect to the Zagreb Coindices
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 65 (011) 85-9 ISSN 0340-653 Extremal Graphs with Respect to the Zagreb Coindices A. R. Ashrafi 1,3,T.Došlić,A.Hamzeh
More informationRedefined Zagreb, Randic, Harmonic and GA Indices of Graphene
International Journal of Mathematical Analysis Vol. 11, 2017, no. 10, 493-502 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijma.2017.7454 Redefined Zagreb, Randic, Harmonic and GA Indices of Graphene
More informationA lower bound for the harmonic index of a graph with minimum degree at least two
Filomat 7:1 013), 51 55 DOI 10.98/FIL1301051W Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat A lower bound for the harmonic index
More informationON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS
Discussiones Mathematicae Graph Theory 34 (2014) 127 136 doi:10.7151/dmgt.1724 ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Dingguo Wang 2,3 and Erfang Shan 1,2 1 School of Management,
More informationWiener Index of Degree Splitting Graph of some Hydrocarbons
Wiener Index of Degree Splitting Graph of some carbons K. Thilakam A. Sumathi PG and Research Department of Mathematics Department of Mathematics Seethalakshmi Ramaswami College Seethalakshmi Ramaswami
More informationA Characterization of the Cactus Graphs with Equal Domination and Connected Domination Numbers
International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 7, 275-281 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.7932 A Characterization of the Cactus Graphs with
More informationImproved bounds on the difference between the Szeged index and the Wiener index of graphs
Improved bounds on the difference between the Szeged index and the Wiener index of graphs Sandi Klavžar a,b,c M. J. Nadjafi-Arani d October 5, 013 a Faculty of Mathematics and Physics, University of Ljubljana,
More informationarxiv: v1 [math.co] 15 Sep 2016
A Method for Computing the Edge-Hyper-Wiener Index of Partial Cubes and an Algorithm for Benzenoid Systems Niko Tratnik Faculty of Natural Sciences and Mathematics, University of Maribor, Slovenia arxiv:1609.0469v1
More informationExtremal trees with fixed degree sequence for atom-bond connectivity index
Filomat 26:4 2012), 683 688 DOI 10.2298/FIL1204683X Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Extremal trees with fixed degree
More informationON SET-INDEXERS OF GRAPHS
Palestine Journal of Mathematics Vol. 3(2) (2014), 273 280 Palestine Polytechnic University-PPU 2014 ON SET-INDEXERS OF GRAPHS Ullas Thomas and Sunil C Mathew Communicated by Ayman Badawi MSC 2010 Classification:
More informationTWO TYPES OF CONNECTIVITY INDICES OF THE LINEAR PARALLELOGRAM BENZENOID
NEW FRONT. CHEM. (04) Former: Ann. West Univ. Timisoara Series Chem. Volume 3, Number, pp. 73-77 ISSN: 4-953 ISSN 393-7; ISSN-L 393-7 West University of Timișoara Article TWO TYPES OF CONNECTIVITY INDICES
More informationSmall Cycle Cover of 2-Connected Cubic Graphs
. Small Cycle Cover of 2-Connected Cubic Graphs Hong-Jian Lai and Xiangwen Li 1 Department of Mathematics West Virginia University, Morgantown WV 26505 Abstract Every 2-connected simple cubic graph of
More informationSecond-Order and Third-Order Connectivity Indices of an Infinite Family of Dendrimer Nanostars
Int. J. Contemp. Math. Sciences, Vol. 6, 20, no. 5, 25-220 Second-Order and Third-Order Connectivity Indices of an Infinite Family of Dendrimer Nanostars Jianguang Yang, Fangli Xia and Shubo Chen Department
More information(Received: 19 October 2018; Received in revised form: 28 November 2018; Accepted: 29 November 2018; Available Online: 3 January 2019)
Discrete Mathematics Letters www.dmlett.com Discrete Math. Lett. 1 019 1 5 Two upper bounds on the weighted Harary indices Azor Emanuel a, Tomislav Došlić b,, Akbar Ali a a Knowledge Unit of Science, University
More informationNowhere 0 mod p dominating sets in multigraphs
Nowhere 0 mod p dominating sets in multigraphs Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel. e-mail: raphy@research.haifa.ac.il Abstract Let G be a graph with
More informationA new version of Zagreb indices. Modjtaba Ghorbani, Mohammad A. Hosseinzadeh. Abstract
Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Filomat 26:1 2012, 93 100 DOI: 10.2298/FIL1201093G A new version of Zagreb indices Modjtaba
More informationDegree Sequence and Supereulerian Graphs
Degree Sequence and Supereulerian Graphs Suohai Fan, Hong-Jian Lai, Yehong Shao, Taoye Zhang and Ju Zhou January 29, 2007 Abstract A sequence d = (d 1, d 2,, d n ) is graphic if there is a simple graph
More informationNew Lower Bounds for the First Variable Zagreb Index
arxiv:1806.02063v1 [math.co] 6 Jun 2018 New Lower Bounds for the First Variable Zagreb Index Alvaro Martínez-Pérez a, José M. Rodríguez b June 7, 2018 a Facultad de Ciencias Sociales, Universidad de Castilla-La
More informationOn the Geometric Arithmetic Index
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun Math Comput Chem 74 (05) 03-0 ISSN 0340-653 On the Geometric Arithmetic Index José M Rodríguez a, José M Sigarreta b a Departamento
More informationBicyclic digraphs with extremal skew energy
Electronic Journal of Linear Algebra Volume 3 Volume 3 (01) Article 01 Bicyclic digraphs with extremal skew energy Xiaoling Shen Yoaping Hou yphou@hunnu.edu.cn Chongyan Zhang Follow this and additional
More informationWiener Indices and Polynomials of Five Graph Operators
Wiener Indices and Polynomials of Five Graph Operators Weigen Yan School of Sciences, Jimei University Xiamen 36101, China, and Academia Sinica Taipei, Taiwan wgyan@math.sinica.edu.tw Yeong-Nan Yeh Inst.
More informationMathematical model for determining octanol-water partition coeffi cient of alkanes
Mathematical model for determining octanol-water partition coeffi cient of alkanes Jelena Sedlar University of Split, Croatia 2nd Croatian Combinatorial Days, Zagreb, Croatia September 27-28, 2018 Jelena
More informationSome properties of the first general Zagreb index
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 47 (2010), Pages 285 294 Some properties of the first general Zagreb index Muhuo Liu Bolian Liu School of Mathematic Science South China Normal University Guangzhou
More informationOn uniquely 3-colorable plane graphs without prescribed adjacent faces 1
arxiv:509.005v [math.co] 0 Sep 05 On uniquely -colorable plane graphs without prescribed adjacent faces Ze-peng LI School of Electronics Engineering and Computer Science Key Laboratory of High Confidence
More informationDiscrete Applied Mathematics archive Volume 156, Issue 10 (May 2008) table of contents Pages Year of Publication: 2008 ISSN: X
Page 1 of 5 Subscribe (Full Service) Register (Limited Service, Free) Search: nmlkj The ACM Digital Library nmlkji The Guide Login Feedback Vertex and edge PI indices of Cartesian product graphs Source
More informationVERTEX-WEIGHTED WIENER POLYNOMIALS OF SUBDIVISION-RELATED GRAPHS. Mahdieh Azari, Ali Iranmanesh, and Tomislav Došlić
Opuscula Math. 36, no. (06), 5 3 http://dx.doi.org/0.7494/opmath.06.36..5 Opuscula Mathematica VERTEX-WEIGHTED WIENER POLYNOMIALS OF SUBDIVISION-RELATED GRAPHS Mahdieh Azari, Ali Iranmanesh, and Tomislav
More informationEulerian Subgraphs in Graphs with Short Cycles
Eulerian Subgraphs in Graphs with Short Cycles Paul A. Catlin Hong-Jian Lai Abstract P. Paulraja recently showed that if every edge of a graph G lies in a cycle of length at most 5 and if G has no induced
More informationDirac s Map-Color Theorem for Choosability
Dirac s Map-Color Theorem for Choosability T. Böhme B. Mohar Technical University of Ilmenau, University of Ljubljana, D-98684 Ilmenau, Germany Jadranska 19, 1111 Ljubljana, Slovenia M. Stiebitz Technical
More informationNEW AND MODIFIED ECCENTRIC INDICES OF OCTAGONAL GRID O m n
NEW AND MODIFIED ECCENTRIC INDICES OF OCTAGONAL GRID O m n M. NAEEM, M. K. SIDDIQUI, J. L. G. GUIRAO AND W. GAO 3 Abstract. The eccentricity ε u of vertex u in a connected graph G, is the distance between
More informationOn the Gutman index and minimum degree
On the Gutman index and minimum degree Jaya Percival Mazorodze 1 Department of Mathematics University of Zimbabwe, Harare, Zimbabwe mazorodzejaya@gmail.com Simon Mukwembi School of Mathematics, Statistics
More informationCOUNTING RELATIONS FOR GENERAL ZAGREB INDICES
Kragujevac Journal of Mathematics Volume 38(1) (2014), Pages 95 103. COUNTING RELATIONS FOR GENERAL ZAGREB INDICES G. BRITTO ANTONY XAVIER 1, E. SURESH 2, AND I. GUTMAN 3 Abstract. The first and second
More informationGraphs with Integer Matching Polynomial Roots
Graphs with Integer Matching Polynomial Roots S. Akbari a, P. Csikvári b, A. Ghafari a, S. Khalashi Ghezelahmad c, M. Nahvi a a Department of Mathematical Sciences, Sharif University of Technology, Tehran,
More informationEvery 3-connected, essentially 11-connected line graph is hamiltonian
Every 3-connected, essentially 11-connected line graph is hamiltonian Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou October 2, 25 Abstract Thomassen conjectured that every 4-connected line graph is hamiltonian.
More informationEulerian Subgraphs and Hamilton-Connected Line Graphs
Eulerian Subgraphs and Hamilton-Connected Line Graphs Hong-Jian Lai Department of Mathematics West Virginia University Morgantown, WV 2606, USA Dengxin Li Department of Mathematics Chongqing Technology
More informationCanadian Journal of Chemistry. On Topological Properties of Dominating David Derived Networks
Canadian Journal of Chemistry On Topological Properties of Dominating David Derived Networks Journal: Canadian Journal of Chemistry Manuscript ID cjc-015-015.r1 Manuscript Type: Article Date Submitted
More informationON THE WIENER INDEX AND LAPLACIAN COEFFICIENTS OF GRAPHS WITH GIVEN DIAMETER OR RADIUS
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 63 (2010) 91-100 ISSN 0340-6253 ON THE WIENER INDEX AND LAPLACIAN COEFFICIENTS OF GRAPHS WITH GIVEN DIAMETER
More informationCounting the average size of Markov graphs
JOURNAL OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4866, ISSN (o) 2303-4947 www.imvibl.org /JOURNALS / JOURNAL Vol. 7(207), -6 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA
More informationOn the sextet polynomial of fullerenes
On the sextet polynomial of fullerenes Jean-Sébastien Sereni Matěj Stehlík Abstract We show that the sextet pattern count of every fullerene is strictly smaller than the Kekulé structure count. This proves
More informationExtremal Topological Indices for Graphs of Given Connectivity
Filomat 29:7 (2015), 1639 1643 DOI 10.2298/FIL1507639T Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Extremal Topological Indices
More informationDegree Sum Conditions and Vertex-Disjoint Cycles in a Graph
Degree Sum Conditions and Vertex-Disjoint Cycles in a Graph Shinya Fujita Hajime Matsumura Department of Mathematics Keio University Yokohama 223-8522, Japan shinyaa@comb.math.keio.ac.jp musimaru@comb.math.keio.ac.jp
More informationCycles of length 1 modulo 3 in graph
Discrete Applied Mathematics 113 (2001) 329 336 Note Cycles of length 1 modulo 3 in graph LU Mei, YU Zhengguang Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China Received
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationThe Reduction of Graph Families Closed under Contraction
The Reduction of Graph Families Closed under Contraction Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 November 24, 2004 Abstract Let S be a family of graphs. Suppose
More informationON THE EDGE-HYPER-HAMILTONIAN LACEABILITY OF BALANCED HYPERCUBES
Discussiones Mathematicae Graph Theory 36 (2016) 805 817 doi:10.7151/dmgt.1908 ON THE EDGE-HYPER-HAMILTONIAN LACEABILITY OF BALANCED HYPERCUBES Jianxiang Cao, Minyong Shi School of Computer Science Communication
More informationTHE WIENER INDEX AND HOSOYA POLYNOMIAL OF A CLASS OF JAHANGIR GRAPHS
Fundamental Journal of Mathematics and Mathematical Sciences Vol. 3, Issue, 05, Pages 9-96 This paper is available online at http://www.frdint.com/ Published online July 3, 05 THE WIENER INDEX AND HOSOYA
More informationHYPER ZAGREB INDEX OF BRIDGE AND CHAIN GRAPHS
Open J. Math. Sci., Vol. 2(2018), No. 1, pp. 1-17 ISSN 2523-0212 Website: http://www.openmathscience.com HYPER ZAGREB INDEX OF BRIDGE AND CHAIN GRAPHS NILANJAN DE 1 Abstract. Let G be a simple connected
More informationTHE GENERALIZED ZAGREB INDEX OF CAPRA-DESIGNED PLANAR BENZENOID SERIES Ca k (C 6 )
Open J Math Sci, Vol 1(2017), No 1, pp 44-51 ISSN 2523-0212 Website: http://wwwopenmathsciencecom THE GENERALIZED ZAGREB INDEX OF CAPRA-DESIGNED PLANAR BENZENOID SERIES Ca k (C 6 ) MUHAMMAD S SARDAR, SOHAIL
More informationarxiv: v1 [math.co] 13 Mar 2018
A note on polyomino chains with extremum general sum-connectivity index Akbar Ali, Tahir Idrees arxiv:1803.04657v1 [math.co] 13 Mar 2018 Knowledge Unit of Science, University of Management & Technology,
More informationApplied Mathematics Letters
Applied Mathematics Letters (009) 15 130 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Spectral characterizations of sandglass graphs
More informationSPANNING TREES WITH A BOUNDED NUMBER OF LEAVES. Junqing Cai, Evelyne Flandrin, Hao Li, and Qiang Sun
Opuscula Math. 37, no. 4 (017), 501 508 http://dx.doi.org/10.7494/opmath.017.37.4.501 Opuscula Mathematica SPANNING TREES WITH A BOUNDED NUMBER OF LEAVES Junqing Cai, Evelyne Flandrin, Hao Li, and Qiang
More informationThe Singular Acyclic Matrices of Even Order with a P-Set of Maximum Size
Filomat 30:13 (016), 3403 3409 DOI 1098/FIL1613403D Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat The Singular Acyclic Matrices of
More informationThe Generalised Randić Index of Trees
The Generalised Randić Index of Trees Paul Balister Béla Bollobás Stefanie Gerke December 10, 2006 Abstract The Generalised Randić index R α (T ) of a tree T is the sum over the edges uv of T of (d(u)d(v))
More informationThe Graovac-Pisanski index of a connected bipartite graph is an integer number
arxiv:1709.04189v1 [math.co] 13 Sep 017 The Graovac-Pisanski index of a connected bipartite graph is an integer number Matevž Črepnjak a,b,c, Martin Knor d, Niko Tratnik a, Petra Žigert Pleteršek a,b a
More informationJOURNAL OF MATHEMATICAL NANOSCIENCE. Connective eccentric index of fullerenes
JOURNAL OF MATHEMATICAL NANOSCIENCE JMNS Vol 1, No 1, 2011, 43-50 Connective eccentric index of fullerenes MODJTABA GHORBANI Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training
More informationApplications of Isometric Embeddings to Chemical Graphs
DIMACS Series in Discrete Mathematics and Theoretical Computer Science Applications of Isometric Embeddings to Chemical Graphs Sandi Klavžar Abstract. Applications of isometric embeddings of benzenoid
More informationOn Trees Having the Same Wiener Index as Their Quadratic Line Graph
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 76 (2016) 731-744 ISSN 0340-6253 On Trees Having the Same Wiener Index as Their Quadratic Line Graph Mohammad
More informationUniform Star-factors of Graphs with Girth Three
Uniform Star-factors of Graphs with Girth Three Yunjian Wu 1 and Qinglin Yu 1,2 1 Center for Combinatorics, LPMC Nankai University, Tianjin, 300071, China 2 Department of Mathematics and Statistics Thompson
More informationSupereulerian planar graphs
Supereulerian planar graphs Hong-Jian Lai and Mingquan Zhan Department of Mathematics West Virginia University, Morgantown, WV 26506, USA Deying Li and Jingzhong Mao Department of Mathematics Central China
More informationThe Fibonacci numbers for the molecular graphs of linear phenylenes
The Fibonacci numbers for the molecular graphs of linear phenylenes Jaroslav Seibert 1 and Libor Koudela 2 Institute of Mathematics and Quantitative Methods Faculty of Economics and Administration University
More informationOn Some Distance-Based Indices of Trees With a Given Matching Number
Applied Mathematical Sciences, Vol. 8, 204, no. 22, 6093-602 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.2988/ams.204.48656 On Some Distance-Based Indices of Trees With a Gien Matching Number Shu
More informationMore on Zagreb Coindices of Composite Graphs
International Mathematical Forum, Vol. 7, 2012, no. 14, 669-673 More on Zagreb Coindices of Composite Graphs Maolin Wang and Hongbo Hua Faculty of Mathematics and Physics Huaiyin Institute of Technology
More informationCorrelation of domination parameters with physicochemical properties of octane isomers
Correlation of domination parameters with physicochemical properties of octane isomers Sunilkumar M. Hosamani Department of mathematics, Rani Channamma University, Belgaum, India e-mail: sunilkumar.rcu@gmail.com
More informationEnumeration of subtrees of trees
Enumeration of subtrees of trees Weigen Yan a,b 1 and Yeong-Nan Yeh b a School of Sciences, Jimei University, Xiamen 36101, China b Institute of Mathematics, Academia Sinica, Taipei 1159. Taiwan. Theoretical
More informationElementary Blocks of Plane Bipartite Graphs
Elementary Blocks of Plane Bipartite Graphs Peter C.B. Lam, W.C. Shiu, Heping Zhang Abstract Let G be a 2-connected plane bipartite graph with perfect matchings, with more than one cycle and with minimum
More information