<?xml version="1.0" encoding="utf-8" ?> <rss version="2.0" xmlns:opensearch="http://a9.com/-/spec/opensearch/1.1/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"> <channel> <title> <![CDATA[ Search for 'su:&quot;Graph connectivity&quot;']]> </title> <link> https://efind.ump.edu.my/cgi-bin/koha/opac-search.pl?q=ccl=su%3A%22Graph%20connectivity%22&#38;sort_by=title_dsc&#38;format=rss </link> <atom:link rel="self" type="application/rss+xml" href="https://efind.ump.edu.my/cgi-bin/koha/opac-search.pl?q=ccl=su%3A%22Graph%20connectivity%22&#38;sort_by=title_dsc&#38;format=rss"/> <description> <![CDATA[ Search results for 'su:&quot;Graph connectivity&quot;' at ]]> </description> <opensearch:totalResults>2</opensearch:totalResults> <opensearch:startIndex>0</opensearch:startIndex> <opensearch:itemsPerPage>30</opensearch:itemsPerPage> <atom:link rel="search" type="application/opensearchdescription+xml" href="https://efind.ump.edu.my/cgi-bin/koha/opac-search.pl?q=ccl=su%3A%22Graph%20connectivity%22&#38;sort_by=title_dsc&#38;format=opensearchdescription"/> <opensearch:Query role="request" searchTerms="q%3Dccl%3Dsu%253A%2522Graph%2520connectivity%2522" startPage="" /> <item> <title> Applications of combinatorial matrix theory to Laplacian matrices of graphs / </title> <dc:identifier>ISBN:9781439863374 (hbk.)</dc:identifier> <link>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=64961</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/1439863377.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Molitierno, Jason J..<br /> Boca Raton, FL : CRC Press, 2012 .<br /> 405 p. : 27 cm..<br /> 9781439863374 (hbk.) </p> ]]> <![CDATA[ <p> <a href="https://efind.ump.edu.my/cgi-bin/koha/opac-reserve.pl?biblionumber=64961">Place hold on <em>Applications of combinatorial matrix theory to Laplacian matrices of graphs /</em></a> </p> ]]> </description> <guid>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=64961</guid> </item> <item> <title> Algorithmic aspects of graph connectivity / </title> <dc:identifier>ISBN:9780521878647 | 0521878640</dc:identifier> <link>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=62575</link> <description> <![CDATA[ <img src="https://images-na.ssl-images-amazon.com/images/P/0521878640.01.TZZZZZZZ.jpg" alt="" /> ]]> <![CDATA[ <p> By Nagamochi, Hiroshi.<br /> New York : Cambridge University Press, 2008 .<br /> xv, 375 p. : 25 cm..<br /> 9780521878647 | 0521878640 </p> ]]> <![CDATA[ <p> <a href="https://efind.ump.edu.my/cgi-bin/koha/opac-reserve.pl?biblionumber=62575">Place hold on <em>Algorithmic aspects of graph connectivity /</em></a> </p> ]]> </description> <guid>https://efind.ump.edu.my/cgi-bin/koha/opac-detail.pl?biblionumber=62575</guid> </item> </channel> </rss>
