<?xml version="1.0" encoding="utf-8" standalone="yes" ?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>network realization | M. Drew LaMar</title>
    <link>/tags/network-realization/</link>
      <atom:link href="/tags/network-realization/index.xml" rel="self" type="application/rss+xml" />
    <description>network realization</description>
    <generator>Source Themes Academic (https://sourcethemes.com/academic/)</generator><language>en-us</language><lastBuildDate>Fri, 01 Jan 2016 00:00:00 +0000</lastBuildDate>
    <image>
      <url>/img/icon-192.png</url>
      <title>network realization</title>
      <link>/tags/network-realization/</link>
    </image>
    
    <item>
      <title>Algorithms and complexity results for finding graphs with extremal Randić index</title>
      <link>/publication/doi-10-1002-net-21680/</link>
      <pubDate>Fri, 01 Jan 2016 00:00:00 +0000</pubDate>
      <guid>/publication/doi-10-1002-net-21680/</guid>
      <description></description>
    </item>
    
  </channel>
</rss>
