<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>0716-0917</journal-id>
<journal-title><![CDATA[Proyecciones (Antofagasta)]]></journal-title>
<abbrev-journal-title><![CDATA[Proyecciones (Antofagasta)]]></abbrev-journal-title>
<issn>0716-0917</issn>
<publisher>
<publisher-name><![CDATA[Universidad Católica del Norte, Departamento de Matemáticas]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0716-09172012000100005</article-id>
<article-id pub-id-type="doi">10.4067/S0716-09172012000100005</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[An upper bound on the largest signless Laplacian of an odd unicyclic graph]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Collao]]></surname>
<given-names><![CDATA[Macarena]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Pizarro]]></surname>
<given-names><![CDATA[Pamela]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rojo]]></surname>
<given-names><![CDATA[Oscar]]></given-names>
</name>
<xref ref-type="aff" rid="A03"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Universidad Catolica del Norte Departamento de Matematicas ]]></institution>
<addr-line><![CDATA[Antofagasta ]]></addr-line>
<country>Chile</country>
</aff>
<aff id="A02">
<institution><![CDATA[,Universidad Catolica del Norte Departamento de Matematicas ]]></institution>
<addr-line><![CDATA[Antofagasta ]]></addr-line>
<country>Chile</country>
</aff>
<aff id="A03">
<institution><![CDATA[,Universidad Catolica del Norte Departamento de Matematicas ]]></institution>
<addr-line><![CDATA[Antofagasta ]]></addr-line>
<country>Chile</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2012</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2012</year>
</pub-date>
<volume>31</volume>
<numero>1</numero>
<fpage>39</fpage>
<lpage>49</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.cl/scielo.php?script=sci_arttext&amp;pid=S0716-09172012000100005&amp;lng=en&amp;nrm=iso&amp;tlng=en"></self-uri><self-uri xlink:href="http://www.scielo.cl/scielo.php?script=sci_abstract&amp;pid=S0716-09172012000100005&amp;lng=en&amp;nrm=iso&amp;tlng=en"></self-uri><self-uri xlink:href="http://www.scielo.cl/scielo.php?script=sci_pdf&amp;pid=S0716-09172012000100005&amp;lng=en&amp;nrm=iso&amp;tlng=en"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[We derive an upper bound on the largest signless Laplacian eigenvalue of an odd unicyclic graph. The bound is given in terms of the largest vertex degree and the largest height of the trees obtained removing the edges of the unique cycle in the graph.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Laplacian matrix]]></kwd>
<kwd lng="en"><![CDATA[signless Laplacian matrix]]></kwd>
<kwd lng="en"><![CDATA[adjacency matrix]]></kwd>
<kwd lng="en"><![CDATA[spectral radius]]></kwd>
<kwd lng="en"><![CDATA[generalized Bethe tree]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[  	    <p align="justify"><font face="verdana" size="2">Proyecciones Journal of Mathematics Vol. 31, N<sup>o</sup> 1, pp. 39&#45;49, March 2012. Universidad Cat&oacute;lica del Norte Antofagasta &#45; Chile</font></p>  	    <p align="justify"><font face="verdana" size="2"><b><font size="4">An upper bound on the largest signless Laplacian of an odd unicyclic graph</font></b></font></p>      <p align="justify"><font face="verdana" size="2"><i><strong>Macarena Collao</strong></i></font></p>     <p align="justify"><font face="verdana" size="2"><i> Universidad Cat&oacute;lica del Norte, Chile</i></font></p>     <p align="justify"><font face="verdana" size="2"><i><strong>Pamela Pizarro</strong> </i></font></p>     <p align="justify"><font face="verdana" size="2"><i>Universidad Cat&oacute;lica del Norte, Chile</i></font></p>     <p align="justify"><font face="verdana" size="2"><i><strong>OSCAR ROJO</strong> </i></font></p>     <p align="justify"><font face="verdana" size="2"><i>Universidad Cat&oacute;lica del Norte, Chile</i></font></p>     <p align="justify">&nbsp;</p> <hr>     ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2"><b>ABSTRACT</b></font></p>     <p align="justify"><font face="verdana" size="2"><i>We derive an upper bound on the largest signless Laplacian eigenvalue of an odd unicyclic graph. The bound is given in terms of the largest vertex degree and the largest height of the trees obtained removing the edges of the unique cycle in the graph.</i></font></p>  	    <p align="justify"><font face="verdana" size="2"><b>AMS classification :</b> <i>05C50, 15A48.</i></font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Keywords :</b> <i>Laplacian matrix; signless Laplacian matrix; adjacency matrix; spectral radius; generalized Bethe tree.</i></font></p> 	    <p align="justify">&nbsp;</p>     	<hr>     <p align="justify"><font face="verdana" size="3"><strong>REFERENCES</strong></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;1&#93; D. Cvetkovic, P. Rowlinson, S. K. Simic, Signless Laplacian of finite graphs, Linear Algebra Appl. 423, pp. 155&#45;171, (2007).    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0716-0917201200010000500001&pid=S0716-09172012000100005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;2&#93; D. Cvetkovic, P. Rowlinson, S. K Simic, Eigenvalue bounds for the signless Laplacian, Publications de L'institute Mathematique, Nou&#45;velle serie tome 81(95), pp. 11&#45;27, (2007).    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0716-0917201200010000500002&pid=S0716-09172012000100005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p>  	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;3&#93; R. Diestel, Graph Theory, Electronic Editions 2005, Springer&#45;Verlag Hiedlberg, New York.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0716-0917201200010000500003&pid=S0716-09172012000100005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;4&#93; G. H. Golub and C. F. van Loan, Matrix Computations, 2nd ed. ,John Hopkins University Press, (1989).    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0716-0917201200010000500004&pid=S0716-09172012000100005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;5&#93; C. S. Oliveira, L. S. de Lima, N. M. M. de Abreu, P. Hansen, Bounds on the index of the signless Laplacian of a graph, Discrete Applied</font> <font face="verdana" size="2">Mathematics 158, pp. 355&#45;360, (2010).    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0716-0917201200010000500005&pid=S0716-09172012000100005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p>      <p align="justify"><font face="verdana" size="2">&#91;6&#93; R. A. Horn, C. R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, (1991).</font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;7&#93; S. Hu, The largest eigenvalue of unicyclic graphs, Discrete Math. 307,</font> <font face="verdana" size="2">pp. 280&#45;284, (2007).    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0716-0917201200010000500007&pid=S0716-09172012000100005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;8&#93; Y. Ikebe, T. Inagaki, S. Miyamoto, The Monotonicity Theorem, Cauchy's Interlace Theorem and Courant&#45;Fisher Theorem, American</font> <font face="verdana" size="2">Mathematical Monthly Vol. 94, No. 4, April, pp. 352&#45;354, (1987).    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0716-0917201200010000500008&pid=S0716-09172012000100005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;9&#93; S. Kouachi, Eigenvalues and eigenvectors of tridiagonal matrices, Electronic Journal of Linear Algebra 15, pp. 115&#45;133, (2006).    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0716-0917201200010000500009&pid=S0716-09172012000100005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;10&#93; O. Rojo, New upper bounds on the spectral radius of unicyclic graphs,</font> <font face="verdana" size="2">Linear Algebra Appl. 428, pp. 754&#45;764, (2008).    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0716-0917201200010000500010&pid=S0716-09172012000100005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;11&#93; O. Rojo, Spectra of copies of a generalized Bethe tree atached to any</font> <font face="verdana" size="2">graph, Linear Algebra Appl. 431, pp. 863&#45;882, (2009).    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0716-0917201200010000500011&pid=S0716-09172012000100005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;12&#93; L. N. Trefethen and D. Bau, III Numerical Linear Algebra, Society for Industrial and Applied Mathematics, (1997).    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0716-0917201200010000500012&pid=S0716-09172012000100005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;13&#93; R. Varga, Matrix Iterative Analysis, Theory, Prentice&#45;Hall, Inc.,</font><font face="verdana" size="2">(1965).    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scieloOrg/php/reflinks.php?refpid=S0716-0917201200010000500013&pid=S0716-09172012000100005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');"></a>&#160;]<!-- end-ref --></font></p>      <p align="justify"><font face="verdana" size="2"><b>Macarena Collao</b></font></p>  	    <p align="justify"><font face="verdana" size="2">Departamento de Matem&aacute;ticas Universidad Cat&oacute;lica del Norte</font></p>      <p align="justify"><font face="verdana" size="2">Casilla 1280</font></p>  	    <p align="justify"><font face="verdana" size="2">Antofagasta</font></p>  	    <p align="justify"><font face="verdana" size="2">Chile</font></p>  	    <p align="justify"><font face="verdana" size="2">e&#45;mail : <a href="mailto:maca_collaom@hotmail.com">maca_collaom@hotmail.com</a></font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Pamela Pizarro</b></font></p>  	    <p align="justify"><font face="verdana" size="2">Departamento de Matem&aacute;ticas Universidad Cat&oacute;lica del Norte</font></p>      <p align="justify"><font face="verdana" size="2">Casilla 1280</font></p>  	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">Antofagasta</font></p>  	    <p align="justify"><font face="verdana" size="2">Chile</font></p>  	    <p align="justify"><font face="verdana" size="2">e&#45;mail : <a href="mailto:parkinzon_triste@hotmail.com">parkinzon_triste@hotmail.com</a></font></p>  	    <p align="justify"><font face="verdana" size="2">and</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Oscar Rojo</b></font></p>  	    <p align="justify"><font face="verdana" size="2">Departamento de Matem&aacute;ticas Universidad Cat&oacute;lica del Norte</font></p>      <p align="justify"><font face="verdana" size="2">Casilla 1280</font></p>  	    <p align="justify"><font face="verdana" size="2">Antofagasta</font></p>  	    <p align="justify"><font face="verdana" size="2">Chile</font></p>  	    <p align="justify"><font face="verdana" size="2">e&#45;mail : <a href="mailto:orojo@ucn.cl">orojo@ucn.cl</a></font></p> 	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2"><i>Received : November 2011. Accepted : January 2012</i></font></p> 	    <p align="justify"><font face="verdana" size="2">*Work supported by Project Fondecyt 1100072, Chile.</font></p>      ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cvetkovic]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Rowlinson]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Simic]]></surname>
<given-names><![CDATA[S. K.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Signless Laplacian of finite graphs]]></article-title>
<source><![CDATA[Linear Algebra Appl.]]></source>
<year>(200</year>
<month>7)</month>
<volume>423</volume>
<page-range>155-171</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cvetkovic]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Rowlinson]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Simic]]></surname>
<given-names><![CDATA[S. K]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Eigenvalue bounds for the signless Laplacian]]></article-title>
<source><![CDATA[Publications de L'institute Mathematique]]></source>
<year>(200</year>
<month>7)</month>
<volume>81</volume>
<numero>(95)</numero>
<issue>(95)</issue>
<page-range>11-27</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Diestel]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Graph Theory]]></source>
<year>2005</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag Hiedlberg]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Golub]]></surname>
<given-names><![CDATA[G. H.]]></given-names>
</name>
<name>
<surname><![CDATA[van Loan]]></surname>
<given-names><![CDATA[C. F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Matrix Computations,]]></source>
<year>(198</year>
<month>9)</month>
<edition>2nd ed</edition>
<publisher-name><![CDATA[John Hopkins University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Oliveira]]></surname>
<given-names><![CDATA[C. S.]]></given-names>
</name>
<name>
<surname><![CDATA[de Lima]]></surname>
<given-names><![CDATA[L. S.]]></given-names>
</name>
<name>
<surname><![CDATA[de Abreu]]></surname>
<given-names><![CDATA[N. M. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Hansen]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Bounds on the index of the signless Laplacian of a graph]]></article-title>
<source><![CDATA[Discrete Applied Mathematics]]></source>
<year>(201</year>
<month>0)</month>
<volume>158</volume>
<page-range>355-360</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Horn]]></surname>
<given-names><![CDATA[R. A]]></given-names>
</name>
<name>
<surname><![CDATA[Johnson]]></surname>
<given-names><![CDATA[C. R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Matrix Analysis]]></source>
<year>(199</year>
<month>1)</month>
<publisher-loc><![CDATA[Cambridge ]]></publisher-loc>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hu]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[The largest eigenvalue of unicyclic graphs]]></article-title>
<source><![CDATA[Discrete Math.]]></source>
<year>(200</year>
<month>7)</month>
<volume>307</volume>
<page-range>280-284</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ikebe]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Inagaki]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Miyamoto]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[The Monotonicity Theorem, Cauchy's Interlace Theorem and Courant-Fisher Theorem]]></article-title>
<source><![CDATA[American Mathematical Monthly]]></source>
<year>(198</year>
<month>7)</month>
<volume>94</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>352-354</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kouachi]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Eigenvalues and eigenvectors of tridiagonal matrices]]></article-title>
<source><![CDATA[Electronic Journal of Linear Algebra]]></source>
<year>(200</year>
<month>6)</month>
<volume>15</volume>
<page-range>115-133</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rojo]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[New upper bounds on the spectral radius of unicyclic graphs]]></article-title>
<source><![CDATA[Linear Algebra Appl.]]></source>
<year>(200</year>
<month>8)</month>
<volume>428</volume>
<page-range>754-764</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rojo]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Spectra of copies of a generalized Bethe tree atached to any graph]]></article-title>
<source><![CDATA[Linear Algebra Appl.]]></source>
<year>(200</year>
<month>9)</month>
<volume>431</volume>
<page-range>863-882</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Trefethen]]></surname>
<given-names><![CDATA[L. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Bau]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[III Numerical Linear Algebra]]></source>
<year>(199</year>
<month>7)</month>
<publisher-name><![CDATA[Society for Industrial and Applied Mathematics]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Varga]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Matrix Iterative Analysis]]></source>
<year>(196</year>
<month>5)</month>
<publisher-name><![CDATA[Prentice-Hall]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
