﻿<?xml version="1.0" encoding="UTF-8"?>
<records>
  <record>
    <language>eng</language>
    <publisher>Science and Education Publishing</publisher>
    <journalTitle>Turkish Journal of Analysis and Number Theory</journalTitle>
    <eissn>2333-1232</eissn>
    <publicationDate>2017-09-22</publicationDate>
    <volume>5</volume>
    <issue>6</issue>
    <startPage>202</startPage>
    <endPage>209</endPage>
    <doi>10.12691/tjant-5-6-2</doi>
    <publisherRecordId>TJANT2017562</publisherRecordId>
    <documentType>article</documentType>
    <title language="eng">Symmetric Division Deg Energy of a Graph</title>
    <authors>
      <author>
        <name>K. N. Prakasha</name>
        <affiliationId>1</affiliationId>
      </author>
      <author>
        <name>P. Siva Kota Reddy</name>
        <affiliationId>2</affiliationId>
      </author>
      <author>
        <name>Ismail Naci Cangul</name>
        <email>ncangul@gmail.com</email>
        <affiliationId>3</affiliationId>
      </author>
    </authors>
    <affiliationsList>
      <affiliationName affiliationId="1">Mathematics, Vidyavardhaka College of Engineering, Mysuru, India</affiliationName>
      <affiliationName affiliationId="2">Mathematics, Siddaganga Institute of Technology, Tumkur, India</affiliationName>
      <affiliationName affiliationId="3">Mathematics, Uludag University, Bursa, Turkey</affiliationName>
    </affiliationsList>
    <abstract language="eng">The purpose of this paper is to introduce and investigate the symmetric division deg energy SDDE(G) of a graph. We establish upper and lower bounds for SDDE(G). Also the symmetric division deg energy for certain graphs with one edge deleted are calculated.</abstract>
    <fullTextUrl format="pdf">http://pubs.sciepub.com/tjant/5/6/2/tjant-5-6-2.pdf</fullTextUrl>
    <keywords language="eng">
      <keyword>symmetric division deg index</keyword>
      <keyword>symmetric division deg eigenvalues</keyword>
      <keyword>symmetric division deg energy</keyword>
      <keyword>k-complement</keyword>
      <keyword>k(i)-complement</keyword>
      <keyword>edge deletion</keyword>
    </keywords>
  </record>
</records>