<?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>0034-7426</journal-id>
<journal-title><![CDATA[Revista Colombiana de Matemáticas]]></journal-title>
<abbrev-journal-title><![CDATA[Rev.colomb.mat.]]></abbrev-journal-title>
<issn>0034-7426</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional de Colombia y Sociedad Colombiana de Matemáticas]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0034-74262008000100005</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Nonderogatory directed windmills]]></article-title>
<article-title xml:lang="es"><![CDATA[Molinos de viento dirigidos no derogatorios]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[RADA]]></surname>
<given-names><![CDATA[JUAN]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Universidad de Los Andes  ]]></institution>
<addr-line><![CDATA[Mérida ]]></addr-line>
<country>Venezuela</country>
</aff>
<pub-date pub-type="pub">
<day>15</day>
<month>06</month>
<year>2008</year>
</pub-date>
<pub-date pub-type="epub">
<day>15</day>
<month>06</month>
<year>2008</year>
</pub-date>
<volume>42</volume>
<numero>1</numero>
<fpage>61</fpage>
<lpage>66</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0034-74262008000100005&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S0034-74262008000100005&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S0034-74262008000100005&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[A directed graph G is nonderogatory if its adjacency matrix A is nonderogatory, i.e., the characteristic polynomial of A is equal to the minimal polynomial of A. Given integers r&ge; 2 and h&ge; 3, a directed windmill Mh(r) is a directed graph obtained by coalescing r dicycles of length h in one vertex. In this article we solve a conjecture proposed by Gan and Koo ([3]): Mh(r) is nonderogatory if and only if r=2.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Un grafo dirigido G es no-derogatorio si su matriz de adyacencia A es no-derogatoria, es decir el polinomio característico de A es igual al polinomio minimal de A. Dados enteros r&ge; 2 y h&ge; 3, el molino de viento dirigido Mh(r) es un grafo dirigido que se obtiene por medio de la coalescencia de r diciclos de longitud h en un vértice. En este artículo resolvemos una conjetura propuesta por Gan y Koo ([3]): Mh(r) es no-derogatorio si, y sólo si, r=2.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Nonderogatory matrix]]></kwd>
<kwd lng="en"><![CDATA[characteristic polynomial of directedgraphs]]></kwd>
<kwd lng="en"><![CDATA[directed windmills]]></kwd>
<kwd lng="es"><![CDATA[matriz no-derogatoria]]></kwd>
<kwd lng="es"><![CDATA[polinomio característico de grafos dirigidos]]></kwd>
<kwd lng="es"><![CDATA[molinos de viento dirigidos]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[ 
<font size="2" face="verdana">

    <p>
<b>
<font size="4">
    <center>
Nonderogatory directed windmills
</center>
</font>
</b>
</p>

    <p>
<b>
<font size="3">
    <center>
Molinos de viento dirigidos no derogatorios
</center>
</font>
</b>
</p>

    <p>
    <center>
JUAN RADA<sup>1</sup>
</center>
</p>

    <p>
<sup>1</sup>Universidad de Los Andes, M&eacute;rida, Venezuela. Email: <a href="mailto:juanrada@ula.ve">juanrada@ula.ve</a>
    <br>
</p>

<hr size="1">

    <p>
<b>
    ]]></body>
<body><![CDATA[<center>
Abstract
</center>
</b>
</p>

    <p>
A directed graph G is nonderogatory if its adjacency matrix A is nonderogatory, i.e., the characteristic polynomial of A is equal to the minimal polynomial of A. Given integers r&ge; 2 and h&ge; 3, a directed windmill M<sub>h</sub>(r) is a directed graph obtained by coalescing r dicycles of length h in one vertex. In this article we solve a conjecture proposed by Gan and Koo ([3]): M<sub>h</sub>(r) is nonderogatory if and only if r=2.
</p>

    <p>
<b>
Key words:
</b>
Nonderogatory matrix,
characteristic polynomial of directedgraphs,
directed windmills.
</p>

<hr size="1">

<i>2000 Mathematics Subject Classification: 05C50.</i>

<hr size="1">

    <p>
<b>
    <center>
Resumen
</center>
</b>
</p>

    <p>
Un grafo dirigido G es no-derogatorio si su matriz de adyacencia A es no-derogatoria, es decir el polinomio caracter&iacute;stico de A es igual al polinomio minimal de A. Dados enteros r&ge; 2 y h&ge; 3, el molino de viento dirigido M<sub>h</sub>(r) es un grafo dirigido que se obtiene por medio de la coalescencia de r diciclos de longitud h en un v&eacute;rtice. En este art&iacute;culo resolvemos una conjetura propuesta por Gan y Koo ([3]): M<sub>h</sub>(r) es no-derogatorio si, y s&oacute;lo si, r=2.
</p>

    <p>
<b>
Palabras clave:
</b>
matriz no-derogatoria,
polinomio caracter&iacute;stico de grafos dirigidos,
molinos de viento dirigidos.
</p>

<hr size="1">

    <p>
Texto completo disponible en <a href="pdf/rcm/v42n1/v42n1a05.pdf">PDF</a>
</p>

<hr size="1">

    <p>
<b>
<font size="3">
References
</font>
</b>
</p>


    <!-- ref --><p>
[1] Cvetkovic, D., Doob, M. & Sachs, H., <i>Spectra of graphs</i>, Academic Press, New York, 1980.
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000022&pid=S0034-7426200800010000500001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p>
[2] Gan, C., Some results on annihilatingly unique digraphs, M.Sc. Thesis, Univesity of Malaya, 1995. Kuala Lumpur, Malaysia..
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000023&pid=S0034-7426200800010000500002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p>
[3] Gan, C. & Koo, V., On annihilating uniqueness of directed windmills, `Proceedings of the ATCM´, (2002), ATCM. Melaka, Malaysia..
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000024&pid=S0034-7426200800010000500003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p>
[4] Lam, K., On digraphs with unique annihilating polynomial, Ph.D. Thesis, University of Malaya, 1990. Kuala Lumpur, Malaysia..
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000025&pid=S0034-7426200800010000500004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p>
[5] Lam, K. & Lim, C., `The characteristic polynomial of ladder digraph and an annihilating uniqueness theorem´, <i>Discrete Mathematics</i> <i>151</i>,  (1996), 161-167.
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=000026&pid=S0034-7426200800010000500005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><center>
<b>(Recibido en octubre  de 2007. Aceptado en febrero de 2008)</b>
</center>
<hr size="1">

    <p>
Este art&iacute;culo se puede citar en <i>LaTeX</i> utilizando la siguiente referencia bibliogr&aacute;fica de <i>BibTeX</i>:
</p>
<code><font size="2">@ARTICLE{RCMv42n1a05,    <br>
 &nbsp;&nbsp;&nbsp; AUTHOR &nbsp;= {Rada, Juan},    <br>
 &nbsp;&nbsp;&nbsp; TITLE &nbsp; = {{Nonderogatory directed windmills}},    <br>
 &nbsp;&nbsp;&nbsp; JOURNAL = {Revista Colombiana de Matem&aacute;ticas},    <br>
&nbsp;&nbsp;&nbsp; YEAR &nbsp;&nbsp; = {2008},    ]]></body>
<body><![CDATA[<br>
&nbsp;&nbsp;&nbsp; volume &nbsp;= {42},    <br>
&nbsp;&nbsp;&nbsp; number &nbsp;= {1},    <br>
&nbsp;&nbsp;&nbsp; pages &nbsp; = {61-66}    <br>
}</font></code>

<hr size="1">
</font>
     ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cvetkovic]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Doob]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Sachs]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Spectra of graphs]]></source>
<year>1980</year>
<publisher-name><![CDATA[Academic Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gan]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Some results on annihilatingly unique digraphs]]></source>
<year></year>
<publisher-loc><![CDATA[Kuala Lumpur ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gan]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Koo]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[On annihilating uniqueness of directed windmills]]></article-title>
<source><![CDATA[`Proceedings of the ATCM´]]></source>
<year>2002</year>
<publisher-loc><![CDATA[Melaka ]]></publisher-loc>
<publisher-name><![CDATA[ATCM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lam]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<source><![CDATA[On digraphs with unique annihilating polynomial]]></source>
<year></year>
<publisher-loc><![CDATA[Kuala Lumpur ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lam]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Lim]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[`The characteristic polynomial of ladder digraph and an annihilating uniqueness theorem´]]></article-title>
<source><![CDATA[Discrete Mathematics]]></source>
<year>1996</year>
<volume>151</volume>
<page-range>161-167</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
