<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">OJAppS</journal-id><journal-title-group><journal-title>Open Journal of Applied Sciences</journal-title></journal-title-group><issn pub-type="epub">2165-3917</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/ojapps.2016.65031</article-id><article-id pub-id-type="publisher-id">OJAppS-66650</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Biomedical&amp;Life Sciences</subject><subject> Chemistry&amp;Materials Science</subject><subject> Computer Science&amp;Communications</subject><subject> Engineering</subject><subject> Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  The First Eccentric Zagreb Index of Linear Polycene Parallelogram of Benzenoid
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>ehdi</surname><given-names>Alaeiyan</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Mohammad</surname><given-names>Reza Farahani</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Muhammad</surname><given-names>Kamran Jamil</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>M.</surname><given-names>R. Rajesh Kanna</given-names></name><xref ref-type="aff" rid="aff3"><sup>3</sup></xref></contrib></contrib-group><aff id="aff2"><addr-line>Department of Mathematics, Riphah Institute of Computing and Applied Sciences (RICAS), Riphah 
International University, Lahore, Pakistan</addr-line></aff><aff id="aff1"><addr-line>Department of Mathematics of Iran University of Science and Technology (IUST), Tehran, Iran</addr-line></aff><aff id="aff3"><addr-line>Department of Mathematics, Maharani’s Science College for Women, Mysore, India</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>mrfarahani88@gmail.com(MRF)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>19</day><month>05</month><year>2016</year></pub-date><volume>06</volume><issue>05</issue><fpage>315</fpage><lpage>318</lpage><history><date date-type="received"><day>21</day>	<month>March</month>	<year>2016</year></date><date date-type="rev-recd"><day>accepted</day>	<month>20</month>	<year>May</year>	</date><date date-type="accepted"><day>23</day>	<month>May</month>	<year>2016</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  Let 
  <em>G</em> = (
  <em>V</em>,
  <em>E</em>) be a graph, where 
  <em>V</em>(
  <em>G</em>) is a non-empty set of vertices and 
  <em>E</em>(
  <em>G</em>) is a set of edges, 
  <em>e</em> = 
  <em>uv</em>∈
  <em>E</em>(
  <em>G</em>), 
  <em>d</em>(
  <em>u</em>) is degree of vertex 
  <em>u</em>. Then the first Zagreb polynomial and the first Zagreb index 
  <em>Zg</em>
  <sub>1</sub>(
  <em>G</em>,
  <em>x</em>) and 
  <em>Zg</em>
  <sub>1</sub>(
  <em>G</em>) of the graph G are defined as Σ
  <sub><em>uv</em>∈<em>E</em>(<em>G</em>)</sub>x
  <sup>(<em>d</em><sub><em>u</em></sub>+<em>d</em><sub><em>v</em></sub>)</sup> and Σ
  <sub><em>e</em>=<em>uv</em>∈<em>E</em>(<em>G</em>)</sub>(
  <em>d</em>
  <sub><em>u</em></sub>+
  <em>d</em>
  <sub><em>v</em></sub>) respectively. Recently Ghorbani and Hosseinzadeh introduced the first Eccentric Zagreb index as
  <em> Zg</em>
  <sub>1</sub>
  <sup style="margin-left:-5px;">*</sup>=Σ
  <sub><em>uv</em>∈<em>E</em>(<em>G</em>)</sub>(
  <em>ecc</em>(
  <em>v</em>)+
  <em>ecc</em>(
  <em>u</em>)), that
  <em> ecc</em>(
  <em>u</em>) is the largest distance between 
  <em>u</em> and any other vertex 
  <em>v</em> of 
  <em>G</em>. In this paper, we compute this new index (the first Eccentric Zagreb index or third Zagreb index) of an infinite family of linear Polycene parallelogram of benzenoid.
 
</p></abstract><kwd-group><kwd>Molecular Graph</kwd><kwd> Linear Polycene Parallelogram of Benzenoid</kwd><kwd> Zagreb Topological Index</kwd><kwd>  Eccentricity Connectivity Index</kwd><kwd> Cut Method</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>By a graph, we mean a finite, undirected, simple graph. We denote the vertex set and the edge set of a graph G by V(G) and E(G), respectively. And the number of first neighbors of vertex u in G (the degree of u) is denoted by d(u). For notation and graph theory terminology not presented here, we follow [<xref ref-type="bibr" rid="scirp.66650-ref1">1</xref>] - [<xref ref-type="bibr" rid="scirp.66650-ref3">3</xref>] . All of the graphs in this paper are simple and a topological index of a graph is a number related to a graph which is invariant under graph automorphisms and is a numeric quantity from the structural graph of a molecule.</p><p>One of the best known and widely used is the Zagreb topological index Zg<sub>1</sub> introduced by I. Gutman and N. Trinajstić in 1972 as [<xref ref-type="bibr" rid="scirp.66650-ref1">1</xref>] [<xref ref-type="bibr" rid="scirp.66650-ref2">2</xref>]</p><disp-formula id="scirp.66650-formula739"><graphic  xlink:href="http://html.scirp.org/file/3-2310564x9.png"  xlink:type="simple"/></disp-formula><p>Also, we know another definition of the first Zagreb index as the sum of the squares of the degrees of all vertices of G.</p><disp-formula id="scirp.66650-formula740"><graphic  xlink:href="http://html.scirp.org/file/3-2310564x10.png"  xlink:type="simple"/></disp-formula><p>where d<sub>u</sub> denotes the degree of u. Mathematical properties of the first Zagreb index for general graphs can be found in [<xref ref-type="bibr" rid="scirp.66650-ref4">4</xref>] - [<xref ref-type="bibr" rid="scirp.66650-ref8">8</xref>] .</p><p>Let x,y&#206;V(G), then the distance d(x,y) between x and y is defined as the length of any shortest path in G connecting x and y [<xref ref-type="bibr" rid="scirp.66650-ref9">9</xref>] - [<xref ref-type="bibr" rid="scirp.66650-ref11">11</xref>] .</p><p>In other words,</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-2310564x11.png" xlink:type="simple"/></inline-formula>.</p><p>The radius and diameter of a graph G are defined as the minimum and maximum eccentricity among vertices of G, respectively. In other words,</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-2310564x12.png" xlink:type="simple"/></inline-formula>,</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-2310564x13.png" xlink:type="simple"/></inline-formula>.</p><p>Recently in 2012, M. Ghorbani and M. A. Hosseinzadeh introduced a new version of first Zagreb index (the Eccentric version and ecc(v) denotes the eccentricity of vertex v) as follows [<xref ref-type="bibr" rid="scirp.66650-ref12">12</xref>] :</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-2310564x14.png" xlink:type="simple"/></inline-formula>.</p><p>In this study, we call this eccentric version of the first Zagreb index by the third Zagreb index and denote by<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-2310564x15.png" xlink:type="simple"/></inline-formula>. And in continue, a formula of the third Zagreb index for an infinite family of linear Polycene parallelogram of benzenoid by using the Cut Method is obtained.</p></sec><sec id="s2"><title>2. Results and Discussion</title><p>In this sections, we compute the third Zagreb index M<sub>3</sub>(G) for linear Polycene parallelogram of benzenoid P(n,n) (&quot;n ≥ 1). This family of benzenoid graph has 2n(n+2) vertices/atoms and</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-2310564x16.png" xlink:type="simple"/></inline-formula>edges (bonds) [<xref ref-type="bibr" rid="scirp.66650-ref13">13</xref>] - [<xref ref-type="bibr" rid="scirp.66650-ref23">23</xref>] . The general representation of linear Po-</p><p>lycene parallelogram of benzenoid P(n,n) is shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>.</p><p>Now, we can exhibit the closed formula of the third Zagreb index M<sub>3</sub>(H<sub>k</sub>) in the following theorem.</p><p>Theorem 1. Considering the linear Polycene parallelogram of benzenoid P(n,n) (&quot;n&#206;ℕ), then its third Zagreb index is equal to</p><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-2310564x17.png" xlink:type="simple"/></inline-formula>.</p><p>Proof. &quot;n&#206;ℕ, let P(n,n) be the linear Polycene parallelogram of benzenoid, as shown in <xref ref-type="fig" rid="fig1">Figure 1</xref>. To achieve our aims, we use of the Cut Method. Definition of the Cut Method and some of its properties are presented in [<xref ref-type="bibr" rid="scirp.66650-ref24">24</xref>] . Thus, we encourage readers to look at <xref ref-type="fig" rid="fig1">Figure 1</xref> and see all cuts of the linear Polycene parallelogram of benzenoid P(n,n).</p><p>So according to <xref ref-type="fig" rid="fig1">Figure 1</xref>, one can see that the eccentric vertices with degree two are between 2n+1, 2n+2, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-2310564x18.png" xlink:type="simple"/></inline-formula>, 4n−6, 4n−4, 4n−2, 4n−1 or the number set</p><disp-formula id="scirp.66650-formula741"><graphic  xlink:href="http://html.scirp.org/file/3-2310564x19.png"  xlink:type="simple"/></disp-formula><p>And also, the eccentric vertices with degree two are between 2n, 2n+1 to 4n−4, 4n−3 or in the number set</p><fig-group id="fig1"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> The eccentric of vertices of linear polycene parallelogram of benzenoid P(n,n) [<xref ref-type="bibr" rid="scirp.66650-ref14">14</xref>] .</title></caption><fig id ="fig1_1"><label></label><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/3-2310564x20.png"/></fig></fig-group><p><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/3-2310564x21.png" xlink:type="simple"/></inline-formula>.</p><p>Therefore, by using above results and [<xref ref-type="bibr" rid="scirp.66650-ref14">14</xref>] - [<xref ref-type="bibr" rid="scirp.66650-ref23">23</xref>] , we have the following computations for the third Zagreb index of the linear Polycene parallelogram of benzenoid P(n,n) as:</p><disp-formula id="scirp.66650-formula742"><graphic  xlink:href="http://html.scirp.org/file/3-2310564x22.png"  xlink:type="simple"/></disp-formula></sec><sec id="s3"><title>Cite this paper</title><p>Mehdi Alaeiyan,Mohammad Reza Farahani,Muhammad Kamran Jamil,M. R. Rajesh Kanna, (2016) The First Eccentric Zagreb Index of Linear Polycene Parallelogram of Benzenoid. Open Journal of Applied Sciences,06,315-318. doi: 10.4236/ojapps.2016.65031</p></sec></body><back><ref-list><title>References</title><ref id="scirp.66650-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Gutman, I. and Trinajstic, N. (1972) Graph Theory and Molecular Orbitals. III. Total π-Electron Energy of Alternant Hydrocarbons. Chemical Physics Letters, 17, 535-538. &lt;br /&gt;http://dx.doi.org/10.1016/0009-2614(72)85099-1</mixed-citation></ref><ref id="scirp.66650-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Gutman, I. and Das, K.C. (2004) The First Zagreb Index 30 Years after. MATCH Communications in Mathematical and in Computer Chemistry, 50, 83-92.</mixed-citation></ref><ref id="scirp.66650-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Todeschini, R. and Consonni, V. (2000) Handbook of Molecular Descriptors. Wiley, Weinheim.  
http://dx.doi.org/10.1002/9783527613106</mixed-citation></ref><ref id="scirp.66650-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Nikolic, S., Kovacevic, G., Milicevic, A. and Trinajstic, N. (2003) The Zagreb Indices 30 Years after. Croatica Chemica Acta, 76, 113-124.</mixed-citation></ref><ref id="scirp.66650-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">DeCaen, D. (1988) An Upper Bound on the Sum of Degrees in a Graph. Discrete Mathematics, 185, 245-248.  
http://dx.doi.org/10.1016/S0012-365X(97)00213-6</mixed-citation></ref><ref id="scirp.66650-ref6"><label>6</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Das</surname><given-names> K.C. </given-names></name>,<etal>et al</etal>. (<year>2003</year>)<article-title>Sharp Bounds for the Sum of the Squares of the Degrees of a Graph</article-title><source> Kragujevac Journal of Mathematics</source><volume> 25</volume>,<fpage> 31</fpage>-<lpage>49</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.66650-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Peled, U.N., Petreschi, R. and Sterbini, A. (1999) (n,e)-Graphs with Maximum Sum of Squares of Degrees. Journal of Graph Theory, 31, 283-295. &lt;br /&gt;http://dx.doi.org/10.1002/(SICI)1097-0118(199908)31:4&lt;283::AID-JGT3&gt;3.0.CO;2-H</mixed-citation></ref><ref id="scirp.66650-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Szekely, L.A., Clark, L.H. and Entringer, R.C. (1992) An Inequality for Degree Sequences. Discrete Mathematics, 103, 293-300. http://dx.doi.org/10.1016/0012-365X(92)90321-6</mixed-citation></ref><ref id="scirp.66650-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Ghorbani, M. and Hosseinzadeh, M.A. (2012) A New Version of Zagreb Indices. Filomat, 26, 93-100. &lt;br /&gt; 
http://dx.doi.org/10.2298/FIL1201093G</mixed-citation></ref><ref id="scirp.66650-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Sharma, V., Goswami, R. and Madan, A.K. (1997) Eccentric Connectivity Index: A Novel Highly of Descriptor for Structure-Property and Structure-Activity Studies. Journal of Chemical Information and Computer Sciences, 37, 273- 282. http://dx.doi.org/10.1021/ci960049h</mixed-citation></ref><ref id="scirp.66650-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Gupta, S., Singh, M. and Madan, A.K. (2000) Connective Eccentricity Index: A Novel Topological Descriptor for Predicting biological Activity. Journal of Molecular Graphics &amp; Modelling, 18, 18-25. &lt;br /&gt; 
http://dx.doi.org/10.1016/S1093-3263(00)00027-9</mixed-citation></ref><ref id="scirp.66650-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Gupta, S., Singh, M. and Madan, A.K. (2002) Application of Graph Theory: Relationship of Eccentric Connectivity Index and Wiener’s Index with Anti-Inammatory Activity. Journal of Mathematical Analysis and Applications, 266, 259-268. http://dx.doi.org/10.1006/jmaa.2000.7243</mixed-citation></ref><ref id="scirp.66650-ref13"><label>13</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Khadikar</surname><given-names> P.V. </given-names></name>,<etal>et al</etal>. (<year>2010</year>)<article-title>Padmakar-Ivan Index in Nanotechnology</article-title><source> Iranian Journal of Mathematical Chemistry</source><volume> 1</volume>,<fpage> 7</fpage>-<lpage>42</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.66650-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Alaeiyan, M., Mojarad, R. and Asadpour, J. (2011) A New Method for Computing Eccentric Connectivity Polynomial of an Infinite Family of Linear Polycene Parallelogram of Benzenoid. Optoelectronics and Advanced Materials-Rapid Communications, 5, 761-763.</mixed-citation></ref><ref id="scirp.66650-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Alaeiyan, M. and Asadpour, J. (2012) Computing the MEC Polynomial of an Infinite Family of the Linear Parallelogram P(n,n). Optoelectronics and Advanced Materials-Rapid Communications, 6, 191-193.</mixed-citation></ref><ref id="scirp.66650-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">Farahani, M.R. (2014) Connective Eccentric Index of Linear Parallelogram P(n,m). International Letters of Chemistry, Physics and Astronomy, 18, 57-62.</mixed-citation></ref><ref id="scirp.66650-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple">Farahani, M.R. (2015) On Connectivity Indices of an Infinite Family of the Linear Parallelogram of Benzenoid Graph. International Letters of Chemistry, Physics and Astronomy, 54, 131-134.</mixed-citation></ref><ref id="scirp.66650-ref18"><label>18</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Farahani</surname><given-names> M.R. </given-names></name>,<etal>et al</etal>. (<year>2014</year>)<article-title>Two Types of Connectivity Indices of the Linear Parallelogram Benzenoid</article-title><source> New Frontiers in Chemistry</source><volume> 23</volume>,<fpage> 73</fpage>-<lpage>77</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.66650-ref19"><label>19</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Farahani</surname><given-names> M.R. </given-names></name>,<etal>et al</etal>. (<year>2015</year>)<article-title>Zagreb Indices and Their Polynomials of the Linear Parallelogram of Benzenoid Graph</article-title><source> Global Journal of Chemistry</source><volume> 1</volume>,<fpage> 16</fpage>-<lpage>19</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.66650-ref20"><label>20</label><mixed-citation publication-type="other" xlink:type="simple">Farahani, M.R., Rajesh Kanna, M.R., Rehman, H.M. and Jamil, M.K. (2016) About the Augmented Eccentric Connectivity Index of Linear Polycene Parallelogram Benzenoid P(n,n). Journal of Environmental Science, Computer Science, Engineering &amp; Technology, in Press.</mixed-citation></ref><ref id="scirp.66650-ref21"><label>21</label><mixed-citation publication-type="other" xlink:type="simple">Farahani, M.R., Jamil, M.K. and Rajesh Kanna, M.R. (2016) About the Ediz Eccentric Connectivity Index of Linear Polycene Parallelogram Benzenoid. International Journal of Scientific &amp; Engineering Research, 7, 1469-1475.</mixed-citation></ref><ref id="scirp.66650-ref22"><label>22</label><mixed-citation publication-type="other" xlink:type="simple">Farahani, M.R., Asadpour, J. and Rajesh Kanna, M.R. (2016) Computing the Geometric-Arithmetic Eccentricity Index of an Infinite Family of Benzenoid. Asian Academic Research Journal of Multidisciplinary, 3, 23-29.</mixed-citation></ref><ref id="scirp.66650-ref23"><label>23</label><mixed-citation publication-type="other" xlink:type="simple">Farahani, M.R., Rajesh Kanna, M.R. and Hosamani, S.M. (2016) On the Second Zagreb Eccentricity Index of Linear Polycene Parallelogram of Benzenoid P(N,N). Journal of Environmental Science, Computer Science, Engineering &amp; Technology, in Press.</mixed-citation></ref><ref id="scirp.66650-ref24"><label>24</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Klavzar</surname><given-names> S. </given-names></name>,<etal>et al</etal>. (<year>2008</year>)<article-title>A Bird’s Eye View of the Cut Method and a Survey of Its Applications in Chemical Graph Theory</article-title><source> MATCH Communications in Mathematical and in Computer Chemistry</source><volume> 60</volume>,<fpage> 255</fpage>-<lpage>274</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref></ref-list></back></article>