1 Ocak 2018 Dergi makalesi Açık Erişim

Nacaroglu, Yasar; Maden, Ayse Dilek

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Nacaroglu, Yasar</dc:creator>
  <dc:creator>Maden, Ayse Dilek</dc:creator>
  <dc:date>2018-01-01</dc:date>
  <dc:description>In this paper, we obtain the upper and lower bounds on the eccentricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers. (c) 2018 University of Kashan Press. All rights reserved</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/36105</dc:identifier>
  <dc:identifier>oai:zenodo.org:36105</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:source>IRANIAN JOURNAL OF MATHEMATICAL CHEMISTRY 9(1) 47-56</dc:source>
  <dc:title>On the Eccentric Connectivity Index of Unicyclic Graphs</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>