\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Novel System and Method for Telephone Network Planing based on Neutrosophic Graph},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2018 2018-01-15 (revised: 10 Year 2018 15 January 2018)}
\def\TheID{\makeatother }
\def\TheDate{2018 2018-01-15}
\title{Novel System and Method for Telephone Network Planing based on Neutrosophic Graph}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Ayoub  Bahnasse}

             \author[2]{Mohamed  Talea}

             \author[3]{Assia  Bakali}

             \affil[1]{  University Hassan II}

\renewcommand\Authands{ and }

\date{\small \em Received: 10 December 2017 Accepted: 4 January 2018 Published: 15 January 2018}

\maketitle


\begin{abstract}
        


Telephony is gaining momentum in the daily lives of individuals and in the activities of all companies. With the great trend towards telephony networks, whether analogue or digital known as Voice over IP (VoIP), the number of calls an individual can receive becomes considerably high. However, effective management of incoming calls to subscribers becomes a necessity. Recently, much attention has been paid towards applications of single-valued neutrosophic graphs in various research fields. One of the suitable reason is it provides a generalized representation of fuzzy graphs (FGs) for dealing with human nature more effectively when compared to existing models i.e. intuitionistic fuzzy graphs (IFGs), inter-valued fuzzy graphs (IVFGs) and bipolar-valued fuzzy graphs (BPVFGs) etc. In this paper we focused on precise analysis of useful information extracted by calls received, not received due to some reasons using the properties of SVNGs. Hence the proposed method introduced one of the first kind of mathematical model for precise analysis of instantaneous traffic beyond the Erlang unit. To achieve this goal an algorithm is proposed for a neutrosophic mobile network model (NMNM) based on a hypothetical data set. In addition, the drawback and further improvement of proposed method with a mathematical proposition is established for it precise applications.

\end{abstract}


\keywords{fuzzy graph, intuitionistic fuzzy graph, information extraction, single-valued neutrosophic graph, mobile networks.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 \par
Novel System and Method for Telephone Network Planing based on Neutrosophic Graph Said Broumi ? , Kifayat Ullah ? , Assia Bakali ? , Mohamed Talea ? , Prem Kumar Singh ¥ , Tahir Mahmood § , Florentin Smarandache ? , Ayoub Bahnasse ? , Santanu Kumar Patro ? \& Angelo de Oliveira ? Abstract-Telephony is gaining momentum in the daily lives of individuals and in the activities of all companies. With the great trend towards telephony networks, whether analogue or digital known as Voice over IP (VoIP), the number of calls an individual can receive becomes considerably high. However, effective management of incoming calls to subscribers becomes a necessity. Recently, much attention has been paid towards applications of single-valued neutrosophic graphs in various research fields. One of the suitable reason is it provides a generalized representation of fuzzy graphs (FGs) for dealing with human nature more effectively when compared to existing models i.e. intuitionistic fuzzy graphs (IFGs), inter-valued fuzzy graphs (IVFGs) and bipolar-valued fuzzy graphs (BPVFGs) etc. In this paper we focused on precise analysis of useful information extracted by calls received, not received due to some reasons using the properties of SVNGs. Hence the proposed method introduced one of the first kind of mathematical model for precise analysis of instantaneous traffic beyond the Erlang unit. To achieve this goal an algorithm is proposed for a neutrosophic mobile network model (NMNM) based on a hypothetical data set. In addition, the drawback and further improvement of proposed method with a mathematical proposition is established for it precise applications. . with the rapid explosion on access to the telephone network, the number of calls received becomes considerable. Nowadays, the terms "priority of incoming call", "priority of numbers", "trust of calling equipment", etc. are used  {\ref [2]}. Guarantee a quality of experience (QoE) for the customer is therefore becoming a necessity and especially a promoter axis.\par
However, the amount of information that the service provider must process to ensure QoE is very high, and the decision to route, hold, or reject the incoming call must be at real-time.\par
Recent time the theory of graph is utilized for various process to deal with uncertainty and vagueness in data sets. It is a mathematical tool which deals with large number of data or information in efficient manner. Graph theory is one of the richest research area in mathematics as it has applications in enormous fields including management sciences \hyperref[b0]{[3]}, social sciences \hyperref[b1]{[4]}, computer sciences \hyperref[b2]{[5]}, communication networks \hyperref[b3]{[6]}, in description of group structures \hyperref[b4]{[7]}, database theory \hyperref[b5]{[8]}, economics \hyperref[b6]{[9]} etc. L. A. Zadeh \hyperref[b7]{[10]} introduced the theory of fuzzy sets (FSs) in 1965 as a tool to deal with uncertainties. It was Kaufmann \hyperref[b8]{[11]} who define FG but an illustrated work on FGs was done by Rosenfeld in \hyperref[b9]{[12]}. The theory of FGs is of great importance and in the recent decades, it has been used extensively in many areas such as cluster analysis \hyperref[b10]{[13]}\hyperref[b11]{[14]}\hyperref[b12]{[15]}\hyperref[b13]{[16]}, slicing \hyperref[b13]{[16]}, in the solution of fuzzy intersecting equations \hyperref[b14]{[17,}\hyperref[b15]{18]}, data base theory \hyperref[b5]{[8]}, networking \hyperref[b16]{[19]}, group structures Although FG theory has been applied to many real-life problems as discussed earlier however literature provide very less attention has been paid about a mobile network model (MNM) and its analysis for information processing. In a mobile network, there are variable factors such as: receiving a call either from known or unknown number, ignoring a call or couldn't attend due to enormous reasons, and rejecting a call for some reasons. In this case, extracting some useful information or pattern to take a particular decision is a major problem for the researchers. To solve this problem the current paper aimed at developing a neutrosophic set based mobilephone network by presenting NMNM in the field off SVNGs. It is proposed that, how SVNGs can be utilized to store the record of incoming or outgoing calls and how neutrosophic logic can be considered a best tool for such type of problems.\par
This article is organized as follows: Section 2 consists of some basic ideas. The complete description of NMNM is presented in section 3. In section 4, an algorithm is proposed while in section 5 the proposed NMNM is illustrated by a flow chart. At the end a hypothetical example is discussed in section 6. Some special circumstances and significance of neutrosophic mobile network model are presented in section 7. The article ended with some advantages of proposed model and some concluding remark and discussion. 
\section[{II.}]{II.} 
\section[{Basic Concepts}]{Basic Concepts}\par
In this section, some elementary concepts are demonstrated related to graphs including FGs, IFGs and SVNGs. For undefined terms and notions, one may refer to \hyperref[b31]{[34]}\hyperref[b32]{[35]}\hyperref[b33]{[36]}\hyperref[b34]{[37]}\hyperref[b35]{[38]}\hyperref[b36]{[39]}\hyperref[b37]{[40]}\hyperref[b38]{[41]}\hyperref[b39]{[42]}\hyperref[b40]{[43]}\hyperref[b41]{[44]}\hyperref[b42]{[45]}\hyperref[b43]{[46]}\hyperref[b47]{50]}. Definition 1 \hyperref[b47]{[50]} ( ) ( ) ( ) ( ) \{ \} , , ,\textbf{:}S S S S x T x I x F x x X = ?\par
The sum of ?? ?? ? (??),?? ?? ? (??)and ?? ?? ? (??) is ( ) ( ) ( )0 3 S S S T x I x F x ? + ? + + ? .\par
To use neutrosophic set in the real life applications such as engineering and scientific problems, it is necessary to consider the interval [0, 1] instead of0 ,1 ? + ? ? ? ? for technical applications. Definition 2: A pair G = (V, E) is known as 1. Fuzzy graph if a) V = \{v i : i ? I\}andT 1 : V ? [0, 1] is the association degree of v i ? V. b) E = ??v i , v j ?: ?v i , v j ? ? V × V?andT 2 : V × V ? [0, 1] is defined as T 2 ?v i , v j ? ? min?T 1 (v i ), T 1 ?v j ?? for all ?v i , v j ? ? E. 2. Intuitionistic fuzzy graph if a) V = \{v i : i ? I\}such as T 1 : V ? [0, 1] is the association degree and F 1 : V ? [0, 1] is the disassociation degree of v i ? V subject to condition 0 ? T 1 + F 1 ? 1. b) E = ??v i , v j ?: ?v i , v j ? ? V × V?T 2 : V × V ? [0, 1]is the association degree and F 2 : V × V ? [0, 1] is the disassociation degree of ?v i , v j ? ? E defined as T 2 ?v i , v j ? ? min?T 1 (v i ), T 1 ?v j ?? and F 2 ?v i , v j ? ? max?F 1 (v i ), F 1 ?v j ??subject to condition 0 ? T 2 + F 2 ? 1 for all ?v i , v j ? ? E. 3. Single-valued neutrosophic graph if a) V = \{v i : i ? I\}such as T 1 : V ? [0, 1] is the association degree, I 1 : V ? [0, 1] is the indeterminacy degree andF 1 : V ? [0, 1] is the disassociation degree of v i ? V subject to condition 0 ? T 1 + I 1 + F 1 ? 3. 
\section[{Global Journal of Computer Science and Technology}]{Global Journal of Computer Science and Technology}\par
Volume XVIII Issue II Version I2 Year 2018 ( ) E © 2018 Global Journals 1\par
Novel System and Method for Telephone Network Planing based on Neutrosophic Graph \hyperref[b17]{[20,}\hyperref[b18]{21]}, chemical structures \hyperref[b19]{[22]}, navigations \hyperref[b20]{[23]}, traffic controlling \hyperref[b21]{[24]} etc. The concept of FGs have worth in graph theory as it is the best tool to deal with uncertainties. K. Atanassov \hyperref[b22]{[25,}\hyperref[b23]{26]} proposed the concept of intuitionistic fuzzy sets, an extension of FSs which creates space for IFGs. The concept of IFGs were proposed by R. Parvathi and M. G. Karunambigai \hyperref[b24]{[27]}.\par
The structure of IFGs is successfully applied in social networks \hyperref[b25]{[28]}, clustering \hyperref[b26]{[29]}, radio coverage network \hyperref[b27]{[30]} and shortest path problems \hyperref[b28]{[31]} etc. IFGs effectively deals with uncertainties due to its advance structure. In 1995 F. Smarandache proposed neutrosophic logic which provides a base for neutrosophic set (NS) theory \hyperref[b29]{[32,}\hyperref[b47]{50]}. NS theory is a generalization of IFSs and among one of the best structures of fuzzy logics describing the uncertain situations soundly. To apply NS theory in real life situations a discrete form of NSs is introduced known as single-valued neutrosophic set (SVNS) \hyperref[b30]{[33]} which give rise to the theory of SVNGs \hyperref[b31]{[34,}\hyperref[b32]{35]}. SVNG is of more advanced structure than IFGs and successfully applied in navigations \hyperref[b33]{[36]}, minimum spanning tree problem \hyperref[b34]{[37]}, shortest path problem \hyperref[b35]{[38]} so far. Some potential work for SVNGs have been done in \hyperref[b36]{[39]}\hyperref[b37]{[40]}\hyperref[b38]{[41]}\hyperref[b39]{[42]}\hyperref[b40]{[43]}\hyperref[b41]{[44]}\hyperref[b42]{[45]}\hyperref[b43]{[46]}\hyperref[b44]{[47]}\hyperref[b45]{[48]}\hyperref[b46]{[49]}\hyperref[b47]{[50]} for partial ignorance in the given information at different granulation \hyperref[b48]{[51]} {\ref [52]}.In this paper, we have focused on analysis of mobile network for extracting some information to describe the offered or carried network for multi-decision analytics.\par
b)   E = ??v i , v j ?: ?v i , v j ? ? V × V?T 2 : V × V ? [0, 1]is the association degree, I 2 : V × V ? [0, 1] is the indeterminacy degree and F 2 : V × V ? [0, 1] is the disassociation degree of ?v i , v j ? ? Edefined as T 2 ?v i , v j ? ? min?T 1 (v i ), T 1 ?v j ??, I 2 ?v i , v j ? ? max ?I 1 (v i ), I 1 ?v j ?? and F 2 ?v i , v j ? ? max?F 1 (v i ), F 1 ?v j ?? subject to condition 0 ? T 2 + I 2 + F 2 ? 3 for all ?v i , v j ? ? E. 
\section[{A Neutrosophic Mobile Netowrk Model}]{A Neutrosophic Mobile Netowrk Model}\par
Computing the load of a given Telephone network is one of the major issue for the researchers to extract some useful information for descriptive analysis of carried or offered traffic. It used to measure by "Erlang Unit" which represents the average number of concurrent calls carried by the given telephone network. As for example a radio channel is busy at all time can be considered as load of 1 Erlang. Similarly, an office having two telephone operators and both are busy on each time. It means the office is having two Erlangs. It means the Erland unit represents the offered traffic value followed by average number of concurrent calls which is basically depends on call arrival rate, ?, and the average call-holding time (the average time of a phone call), h, given by: (https://en.wikipedia.org/wiki/Erlang\textunderscore (unit)). 
\section[{E= ? h}]{E= ? h}\par
(1)\par
Where h and ? are represented by the same units of time (seconds and calls per second, or minutes and calls per minute).\par
The problem arises when the user or expert want to analyze the instantaneous traffic to find the exact number of calls received, not received or uncertain due to some reasons to know the level of traffic, recording devices, or solving other security issues. In this case, characterizing the uncertainty and vagueness in telephone network based on its acceptation, rejection and indeterminacy is major problem. To solve this problem current paper introduces a mathematical representation of telephone network using SVNGs where (??, ??, ??) can further be divided into some situations as given below:\par
?? can be considered as received calls and is divided into subcases  {\ref [} calls coming from a saved number and ?? ?? represents calls made from some unknown numbers or these can be calls from family member or from friend's circle or from unknown number etc.\par
?? can be considered as calls which couldn't be answered due to many reasons [?? ?? , ?? ?? , ?? ?? , ? ?? ?? ] represents calls not attended due to driving, busy schedule or meeting or incoming call is from unknown number or any other reason.\par
?? represents those calls which are rejected due to numerous reasons such as [?? ?? , ?? ?? , ?? ?? , ? ?? ?? ] stand for rejected calls as incoming call is from unknown number or due to hate or behavior of caller etc.\par
The value of ð?"ð?"ð?"ð?"ð?"ð?"ð?"ð?"ð?"ð?", ????ð?"ð?"ð?"ð?"ð?"ð?"???? ?????? ??????????ð?"ð?"?? membership grades can be calculated as (2)\par
where S is the total number of incoming calls.\par
Neutrosophic mobile network model is presented in the following figure 3. 
\section[{Figure 1: Neutrosophic Mobile Network Model}]{Figure 1: Neutrosophic Mobile Network Model}\par
The figure 3 represents a neutrosophic mobile network model. Using the formula (2), the values of ?? 2 , ?? 2 , ?? 2 changes in different situations. This value becomes (0, 1, 0) when no calls is received and it becomes (0, 0, 1) when all calls are rejected.\par
The following example illustrate NMNM in a better way. Example 1: Let us suppose 100 calls came on a mobile at end of the day and described in form of following information: 1. 60 calls were received truly among them 50 numbers are saved and 10 were unsaved in mobile.\par
In this case these 60 calls will be considered as truth membership i.e. 0.6. 2. 30 calls were not-received by mobile holder. Among them 20 calls which are saved in mobile contacts were not received due to driving, meeting, or phone left in home, car or bag and 10 were not received due to uncertain numbers. In this case all 30 not received numbers by any cause (i.e. driving, meeting or phone left in home) will be considered as Indeterminacy membership i.e. 0.3. 3. 10 calls were those number which was rejected calls intentionally by mobile holder due to behavior of those saved numbers, not useful calls, marketing numbers or other cases for that he/she do not want to pick or may be blocked numbers. In all cases these calls can be considered as false i.e. 0.1 membership value. 
\section[{Global Journal of Computer Science and Technology}]{Global Journal of Computer Science and Technology}\par
Volume XVIII Issue II Version I It is clear from the above explanation that in NMNM, all possibilities can be described effectively. Such a model based on SVNGs described uncertain situation better than crisp graphs or fuzzy graphs or intuitionistic fuzzy graphs due to diverse nature of the NS theory. Moreover, it should be noted that in this network the total number of incoming calls is equal to ?? + ?? + ?? denoted by ??.\par
The above situation can be represented as: ? neutrosophic set: (0.6, 0.  
\section[{Algorithm}]{Algorithm}\par
In this section, an algorithm is proposed describing the flow of NMNM. Here a network of some neutrosophic mobile phones is assumed and the quantity of received, not attended and rejected calls is expressed in the form of single-valued neutrosophic numbers. The NMNM is not limited to store the data of small networks but it can be applied to large networks as well.\par
It is assumed that the number of incoming calls received or not received or rejected could be unlimited in this case. In order to calculate the membership grades of ??, ?? and ??, formula given in(2) could be of use. The edges in NMNM enables us to get the percentage of calls attended, ignored or rejected at any instant between two mobile numbers. To enable the caller for making or receiving unlimited number of calls, we must assign a neutrosophic number (1, 1, 1) to each vertex.\par
? Let ?? ?? = (1, 1, 1) and ?? ?? = (1, 1, 1) be two vertices representing two mobile phone numbers.\par
? ?? ???? = ??? ???? , ?? ???? , ?? ???? ? be the edge of ?? ?? and ?? ?? .\par
? Let ?? denote the number of all calls between two neutrosophic mobile numbers.? ?? ???? = ?????????????????????????????????????????? ?? ? ?? ???? = ?????????????????????????????????????????????????????? ?? ? ?? ???? = ?????????????????????????????????????????? ??\par
This can be written as following propositions:\par
Let us suppose, total number of all calls between two neutrosophic mobile number =s, m= total number of calls received, n-total number of calls rejected then the number of unattended calls are (s-mn). This can be written as ( ) neutrosophic number for determining the n th call.\par
Initially one call is made and received then truth value is 1 1 = 1, indeterminacy value is 0, falsity value is 0. In case two calls are made and received then too truth value is 2 2 = 1 and so on? If two calls are made and 1 is received and 1 ignored, then truth is 1 2 = 0.5 and indeterminacy is 1 2 = 0.5 so we may say that 50\% calls are received and 50\% are ignored. If 3 calls are made and number of received, ignored and rejected calls are 1 so we have (0.33, 0.33, 0.33) which make sense that 33\% calls are received, 33\% calls are ignored and 33\% calls are rejected. Similarly, the algorithm works for n th calls.\par
The algorithm proposed here explain every possibility that might be happen in a mobile network proving the worth of SVNGs as the most suitable tool for modeling such type of network.\par
V. 
\section[{Flowchart}]{Flowchart}\par
A flowchart below described the NMNM step by step. It is assumed here that the total number of call could possibly be received or ignored or rejected is 100 (For the sack of simplicity). Here it is also assumed that initially the number of phone calls made so far is zero. In other words, it may be assumed that initially there is no  In this flow chart, we keep the number of calls limited to 100 but in large networks or in real-life this number of calls cannot be restricted to 100. So, one may set the desired range of calls by their own consent. 
\section[{VI.}]{VI.} 
\section[{Illustrated Example}]{Illustrated Example}\par
Consider a network of three people connect to each other via mobile phones which are represented by vertices of SVNGs. The following table 1 describe the calling data (total number of calls, received calls, calls not attended and rejected calls) of these three peoples.   
\section[{Some Special Circumstances and Significance of Neutrosophic Mobile Network Model}]{Some Special Circumstances and Significance of Neutrosophic Mobile Network Model}\par
In this part of the article, some special cases are listed to extract meaningful information from the proposed method. It is discussed how proposed model is capable of dealing with such kind of situations. This is done in the following way: Question 1: Is there any difference between saved and unsaved numbers? Did it influence the membership? Answer: The answer to this question should be of the following form: When both saved and unsaved numbers are So saved and unsaved numbers are treated equally in such scenario. But In case the number is saved most probably the holder knows the person and pick the phone or reject it most of time. However, when number is unsaved then many times holders do not want to pick which affects indeterminacy membershipvalues a lot.\par
Question 2: How the proposed model deals with marketing numbers as they are important some time while some other time they are meaningless. Answer: We have introduced a unique scenario to understand the telephone network using single-valued neutrosophic set and its properties as a first basic algorithm when none of the approaches are exists in this regard. Of course, we can control this issue by two cases. The first way is when we do not know that the incoming call is marketing call so it may be rejected or ignored. In second case, when we want to pick the same marketing call in some other time then the number can be saved in the phone as useful number. In this case the first time its membership-values will affect the indeterminacy or falsity value whereas in second case it affects the truth membership-values. Question 3: When a person is in comma, then all calls on his/her mobile shall be left unattended similarly when a person is kidnapped, then all calls on his/her mobile gets rejection. How the proposed method explains such situation? Answer: This is an impressive question towards one of the useful applications of our motive to introduce neutrosophic set in telephone network. 
\section[{Global Journal of Computer Science and Technology}]{Global Journal of Computer Science and Technology}\par
Volume XVIII Issue II Version I We will first try to understand the first case that is Coma means holder is in the operating system. In this case the call may go but holder cannot pick it due to uncertainty. Hence all the incoming call on holder's mobile will be unreceived (not rejected only unreceived) which can be clearly shown by (0, 1, 0). For example, suppose 10 calls came on to his/her mobile and are left unattended?. i.e. s = 10, m = 0and n = 0. Then Now we can understand the case of kidnapping. In this case, the call can be rejected by kidnapper or switch off the phone. It is well known that the kidnapper will not pick the phone or allow to ring the bell several times to understand the location. Hence all calls will be rejected and can be represented as (0, 0, 1) for all time. For example, if 10 calls made and rejected. Then n = 10, s = 10. ? Hence the proposed NMNM can deal with every possibility than one my face. It shows its significance in extracting some meaningful information from mobile network based on their calls received and rejected. The analysis derived from the proposed method will be helpful in making an intelligent system.\par
In this article, the mobile network is discussed in the environment of SVNGs. It is observed that such a network cannot be established by ordinary FSs i.e. by FGs as FS theory only deals with association degree. Similarly, such a network is difficult to establish in the environment of IFS theory as it describes the association and dissociation degree of elements but in mobile network models we face several types of situations as described earlier. Therefore, the space of SVNG is so far, a best tool for describing such type of situation and for establishing a mobile network model. 
\section[{VIII.}]{VIII.} 
\section[{Conclusion and Discussion}]{Conclusion and Discussion}\par
In this article, a method for information analysis in mobile network model is described using SVNGs, known as NMNM for precise representation of instantaneous traffic in an alternative way when compared to Erlang Number. The proposed method also describes the structure of FSs and IFSs to make it less resourceful in establishing such type of network for extracting some useful information. A mathematical proposition is also derived for restructuring the SVNGs to represent the received, un-received as well as uncertain calls when compared for depth analysis. The proposed NMNM model is explained using an illustrative example for better understanding. However, the analysis derived from the proposed method is not implemented in any real data sets. To solve this problem in near future the author will focus on comparative study of the proposed method. 9 Year 2018 ( )\begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Example:}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-3.png}
\caption{\label{fig_1}Figure 1}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{2}\includegraphics[]{image-4.png}
\caption{\label{fig_2}Figure 2}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{fig_3}}\end{figure}
      \begin{figure}[htbp]
\noindent\textbf{1} \par 
\begin{longtable}{P{0.11292857142857143\textwidth}P{0.102\textwidth}P{0.15785714285714286\textwidth}P{0.0012142857142857142\textwidth}P{0.19914285714285715\textwidth}P{0.027928571428571428\textwidth}P{0.12264285714285715\textwidth}P{0.12628571428571428\textwidth}}
\tabcellsep \tabcellsep \tabcellsep \tabcellsep Start\tabcellsep \\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep Incoming call\tabcellsep \\
\tabcellsep \tabcellsep \tabcellsep \tabcellsep from ?? ?? to ?? ??\tabcellsep \\
Year 2018\tabcellsep \tabcellsep If call from ?? ??\tabcellsep \tabcellsep If call from ?? ??\tabcellsep \tabcellsep If call from ?? ??\\
6\tabcellsep \tabcellsep accepted by ?? ??\tabcellsep \tabcellsep unattended by ?? ?? ignored or left\tabcellsep \tabcellsep rejected by ?? ??\\
Volume XVIII Issue II Version I\tabcellsep \tabcellsep Use formula 2 to calculate the value of ?? ????\tabcellsep \tabcellsep \multicolumn{2}{l}{Use formula 2 to calculate the value of ?? ????}\tabcellsep Use formula 2 to calculate the value of ?? ????\\
)\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
E\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
(\tabcellsep \tabcellsep \tabcellsep \tabcellsep \tabcellsep \\
Global Journal of Computer Science and Technology\tabcellsep Pair John-Aslam Aslam-Chris Chris-Aslam Chris-John\tabcellsep \multicolumn{2}{l}{Total calls Received calls 24 15 15 7 19 15 5 0}\tabcellsep Not attended calls 5 5 4 5\tabcellsep \multicolumn{2}{l}{Rejected calls 4 3 0 0}\tabcellsep Corresponding Edge (0.466667, 0.3333, 0.2) (0.789474, 0.210526, 0) (0, 1, 0) (0.625, 0.208333, 0.166667)\\
\tabcellsep John-Chris\tabcellsep 8\tabcellsep 4\tabcellsep 3\tabcellsep 1\tabcellsep (0.5, 0.375, 0.125)\\
\tabcellsep © 2018 Global Journals 1\tabcellsep \tabcellsep \tabcellsep \tabcellsep \end{longtable} \par
 
\caption{\label{tab_3}Table 1 :}\end{figure}
 			\footnote{© 2018 Global JournalsNovel System and Method for Telephone Network Planing based on Neutrosophic Graph} 		 		\backmatter   			 
\subsection[{Acknowledgements}]{Acknowledgements}\par
The authors are very grateful to the chief editor and reviewers for their comments and suggestions, which is helpful in improving the chapter. 			  			  				\begin{bibitemlist}{1}
\bibitem[Karunambigai et al. ()]{b26}\label{b26} 	 		\textit{},  		 			M G Karunambigai 		,  		 			M Akram 		,  		 			S Sivasankar 		,  		 			K Palanivel 		.  	 	 		\textit{Int. J. Unc. Fuzz. Knowl. Based Syst}  		2017. 25 p. .  	 
\bibitem[Ding ()]{b10}\label{b10} 	 		‘A clustering dynamic state method for maximal trees in fuzzy graph theory’.  		 			B Ding 		.  	 	 		\textit{J. Numer. Methods Comput. Appl}  		1992. 13 p. .  	 
\bibitem[Harary ()]{b4}\label{b4} 	 		\textit{A Description of Strengthening and Weakening Members of a Group},  		 			Ross I C Harary 		,  		 			F 		.  		1959. Sociometry22. p. .  	 
\bibitem[Hamidi and Saeid ()]{b38}\label{b38} 	 		‘Accessible single-valued neutrosophic graphs’.  		 			M Hamidi 		,  		 			A Saeid 		.  	 	 		\textit{Journal of Applied Mathematics and Computing}  		2017. p. .  	 
\bibitem[Takeda and Nishida ()]{b17}\label{b17} 	 		‘An application of fuzzy graph to the problem concerning group structure’.  		 			E Takeda 		,  		 			T Nishida 		.  	 	 		\textit{J. Operations Res. Soc. Japan}  		1976. 19 p. .  	 
\bibitem[Kiss ()]{b5}\label{b5} 	 		‘An application of fuzzy graphs in database theory, Automata, languages and programming systems’.  		 			A Kiss 		.  	 	 		\textit{Pure Math, Appl. Ser. A}  		1990. 1991. 1 p. .  	 
\bibitem[Broumi et al. ()]{b39}\label{b39} 	 		‘An Introduction to Bipolar Single Valued Neutrosophic Graph Theory’.  		 			S Broumi 		,  		 			F Smarandache 		,  		 			M Talea 		,  		 			A Bakali 		.  	 	 		\textit{Applied Mechanics and Materials}  		2016. 841 p. .  	 
\bibitem[Myna ()]{b21}\label{b21} 	 		‘Application of Fuzzy Graph in Traffic’.  		 			R Myna 		.  	 	 		\textit{International Journal of Scientific \& Engineering Research}  		2015. p. .  	 
\bibitem[Mordeson and Nair ()]{b18}\label{b18} 	 		‘Applications of Fuzzy Graphs’.  		 			J Mordeson 		,  		 			P Nair 		.  	 	 		\textit{Fuzzy Graphs and Fuzzy Hypergraphs. Studies in Fuzziness and Soft Computing},  				 			J N Mordeson,  			P S Nair 		 (ed.)  		 (Physica, Heidelberg)  		2000. 46.  	 
\bibitem[Shirinivas ()]{b2}\label{b2} 	 		‘Applications of graph theory in computer science an overview’.  		 			S G Shirinivas 		,  		 			ElangoN 		.  	 	 		\textit{International Journal of Engineering Science and Technology}  		2010. 2  (9)  p. .  	 
\bibitem[Mukherjee ()]{b28}\label{b28} 	 		‘Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment’.  		 			S Mukherjee 		.  	 	 		\textit{Journal of Mathematical Modelling and Algorithms}  		2012. p. .  	 
\bibitem[Rosenfeld ()]{b9}\label{b9} 	 		‘Fuzzy graphs’.  		 			A Rosenfeld 		.  	 	 		\textit{Fuzzy Sets and Their Applications},  				 			L A Zadeh,  			K S Fu,  			M Shimura 		 (ed.)  		1975. Academic Press. p. .  	 
\bibitem[Kóczy ()]{b16}\label{b16} 	 		‘Fuzzy graphs in the evaluation and optimization of networks’.  		 			L Kóczy 		.  	 	 		\textit{Fuzzy Sets and Systems}  		1992. 46 p. .  	 
\bibitem[Mordeson and Pengc ()]{b14}\label{b14} 	 		‘Fuzzy intersection equations’.  		 			J Mordeson 		,  		 			-S Pengc 		.  	 	 		\textit{Fuzzy Sets and Systems}  		1993. 60 p. .  	 
\bibitem[Bezdek ()]{b11}\label{b11} 	 		‘Fuzzy partitions and relations an axiomatic basis for clustering’.  		 			J Bezdek 		,  		 			HarrisJ 		.  	 	 		\textit{Fuzzy Sets and Systems}  		1978. 1 p. .  	 
\bibitem[Randyanto ()]{b25}\label{b25} 	 		‘Fuzzy queries processing based on intuitionistic fuzzy social relational networks’.  		 			Chen S M Randyanto 		,  		 			ChengS 		.  	 	 		\textit{Information Sciences}  		2016. 327 p. .  	 
\bibitem[Yeh and Bang ()]{b12}\label{b12} 	 		‘Fuzzy relations, fuzzy graphs, and their applications to clustering analysis’.  		 			R Yeh 		,  		 			S Bang 		.  	 	 		\textit{Fuzzy Sets and Their Applications},  				 			L A Zadeh,  			K S Fu,  			M Shimura 		 (ed.)  		1975. Academic Press. p. .  	 
\bibitem[Zadeh ()]{b7}\label{b7} 	 		‘Fuzzy Sets’.  		 			L Zadeh 		.  	 	 		\textit{Information and Control}  		1965. 8 p. .  	 
\bibitem[Harary ()]{b0}\label{b0} 	 		‘Graph Theoretic Methods in the Management Sciences’.  		 			F Harary 		.  	 	 		\textit{Management Science}  		1959. 5 p. .  	 
\bibitem[Keller ()]{b6}\label{b6} 	 		‘Graph theory and economic models: from small to large size applications’.  		 			A Keller 		.  	 	 		\textit{Electronic Notes in Discrete Mathematics},  				2007. 28 p. .  	 
\bibitem[Harary ()]{b1}\label{b1} 	 		‘Graph Theory as a Mathematical Model in Social Science’.  		 			F Harary 		,  		 			NormanR 		.  	 	 		\textit{Ann Arbor, Mich., Institute for Social Research}  		1953.  	 
\bibitem[Singh]{b48}\label{b48} 	 		\textit{Interval-valued neutrosophic graph representation of concept lattice and its},  		 			P K Singh 		.  		 	 
\bibitem[Kaufmann ()]{b8}\label{b8} 	 		\textit{Introduction a la Theorie des sonsensembles flous},  		 			A Kaufmann 		.  		1973. Masson Paris. 1 p. .  	 
\bibitem[Atanassovk ()]{b22}\label{b22} 	 		‘Intuitionistic fuzzy sets’.  		 			Atanassovk 		.  	 	 		\textit{Fuzzy Sets and Systems}  		1986. p. .  	 
\bibitem[Parvathir and Karunambigaim]{b24}\label{b24} 	 		‘Intuitionisticfuzzy graphs’.  		 			Parvathir 		,  		 			G Karunambigaim 		.  	 	 		\textit{Computational Intelligence}  		p. .  	 	 (Theory and Applications) 
\bibitem[Shah and Broumi ()]{b43}\label{b43} 	 		‘Irregular Neutrosophic Graphs’.  		 			N Shah 		,  		 			S Broumi 		.  		 \xref{http://dx.doi.org/org/10.5281/zenodo.570846}{org/10.5281/zenodo.570846}.  	 	 		\textit{Neutrosophic Sets and Systems}  		2016. 13 p. .  	 
\bibitem[Broumi et al. ()]{b42}\label{b42} 	 		‘Isolated Single Valued Neutrosophic Graphs’.  		 			S Broumi 		,  		 			A Bakali 		,  		 			M Talea 		,  		 			F Smarandache 		.  		 \xref{http://dx.doi.org/10.5281/zenodo.571458}{10.5281/zenodo.571458}.  		 \url{doi.org/10.5281/zenodo.571458}  	 	 		\textit{Neutrosophic Sets and Systems},  				2016. 11 p. .  	 
\bibitem[Matula ()]{b13}\label{b13} 	 		‘k-components, clusters, and slicings in graphs’.  		 			D Matula 		.  	 	 		\textit{SIAM J. Appl. Math}  		1972. 22 p. .  	 
\bibitem[Smarandache and Neutrosophy ()]{b47}\label{b47} 	 		‘Neutrosophic Probability, Set, and Logic’.  		 			F Smarandache 		,  		 			Neutrosophy 		.  	 	 		\textit{ProQuest Information \& Learning},  				 (Ann Arbor, Michigan, USA)  		1998. p. 105.  	 
\bibitem[Smarandache ()]{b29}\label{b29} 	 		‘Neutrosophic set -a generalization of the intuitionistic fuzzy set’.  		 			F Smarandache 		.  	 	 		\textit{IEEE International Conference},  				2006. 2006. p. .  	 	 (Granular Computing) 
\bibitem[Shah and Hussain ()]{b45}\label{b45} 	 		‘Neutrosophic Soft Graphs’.  		 			N Shah 		,  		 			A Hussain 		.  		 \xref{http://dx.doi.org/10.5281/zenodo.571574}{10.5281/zenodo.571574}.  		 \url{doi.org/10.5281/zenodo.571574}  	 	 		\textit{Neutrosophic Sets and Systems11},  				2016. p. .  	 
\bibitem[Atanassovk ()]{b23}\label{b23} 	 		\textit{On intuitionistic fuzzy set theory},  		 			Atanassovk 		.  		2012. Heidelberg: Springer.  	 
\bibitem[Liu ()]{b15}\label{b15} 	 		‘On some systems of simultaneous equations in a completely distributive lattice’.  		 			W Liu 		.  	 	 		\textit{Inform. Sci}  		1990. 50 p. .  	 
\bibitem[Naz et al. ()]{b33}\label{b33} 	 		‘Operations on single valued neutrosophic graphs with application’.  		 			S Naz 		,  		 			H Rashmanlou 		,  		 			M A Malik 		.  	 	 		\textit{Journal of Intelligent \& Fuzzy Systems}  		2017. 32  (3)  p. .  	 
\bibitem[Akram and Shahzadi ()]{b36}\label{b36} 	 		‘Operations on single-valued neutrosophic graphs’.  		 			M Akram 		,  		 			G Shahzadi 		.  	 	 		\textit{J. Uncertain Syst}  		2017. 11  (1)  p. .  	 
\bibitem[Malik et al. ()]{b46}\label{b46} 	 		‘Regular Single Valued Neutrosophic Hypergraphs’.  		 			M A Malik 		,  		 			A Hassan 		,  		 			S Broumi 		,  		 			F Smarandache 		.  		 \xref{http://dx.doi.org/10.5281/zenodo.570865}{10.5281/zenodo.570865}.  		 \url{doi.org/10.5281/zenodo.570865}  	 	 		\textit{Neutrosophic Sets and Systems}  		2016. 13 p. .  	 
\bibitem[Neumann ()]{b20}\label{b20} 	 		‘Routing Planning as An Application of Graph Theory with Fuzzy Logic’.  		 			T Neumann 		.  	 	 		\textit{TransNav, the International Journal on Marine Navigation and Safety of Sea Transportation}  		2016. 10  (4) .  	 
\bibitem[Broumi et al.]{b35}\label{b35} 	 		‘Shortest path problem on single valued neutrosophic graphs’.  		 			S Broumi 		,  		 			M Talea 		,  		 			A Bakali 		,  		 			F Smarandache 		,  		 			P Kumar 		.  	 	 		\textit{InNetworks, Computers and Communications}  		ISNCC. p. 2017.  	 
\bibitem[Broumi et al. ()]{b31}\label{b31} 	 		‘Single Valued Neutrosophic Graphs’.  		 			S Broumi 		,  		 			M Talea 		,  		 			A Bakali 		.  	 	 		\textit{Journal of New}  		2016. 10 p. .  	 
\bibitem[Broumi et al. ()]{b32}\label{b32} 	 		‘Single Valued Neutrosophic Graphs: Degree, Order and Size’.  		 			S Broumi 		,  		 			M Talea 		,  		 			F Smarandache 		.  	 	 		\textit{IEEE International Conferenceon Fuzzy Systems (FUZZ)},  				2016. p. .  	 
\bibitem[Wang et al. ()]{b30}\label{b30} 	 		‘Single valued Neutrosophic Sets’.  		 			H Wang 		,  		 			F Smarandache 		,  		 			Y Zhang 		,  		 			Sunderraman 		.  	 	 		\textit{Multisspace and Multistructure4}  		2010. p. .  	 
\bibitem[Ye ()]{b34}\label{b34} 	 		‘Single-valued neutrosophic minimum spanning tree and its clustering method’.  		 			J Ye 		.  	 	 		\textit{Journal of intelligent Systems}  		2014. 23  (3)  p. .  	 
\bibitem[Akram ()]{b37}\label{b37} 	 		‘Single-valued neutrosophic planar graphs’.  		 			M Akram 		.  	 	 		\textit{International Journal of Algebra and Statistics}  		2016. 5  (2)  p. .  	 
\bibitem[Shah ()]{b44}\label{b44} 	 		‘Some Studies in Neutrosophic Graphs’.  		 			N Shah 		.  		 \xref{http://dx.doi.org/10.5281/zenodo.571148}{10.5281/zenodo.571148}.  		 \url{doi.org/10.5281/zenodo.571148}  	 	 		\textit{Neutrosophic Sets and Systems}  		2016. 12 p. .  	 
\bibitem[Karthick and Narayanamoorthy ()]{b27}\label{b27} 	 		‘The Intuitionistic Fuzzy Line Graph Model to Investigate Radio Coverage Network’.  		 			P Karthick 		,  		 			S Narayanamoorthy 		.  	 	 		\textit{International Journal of Pure and Applied Mathematics}  		2016. 109  (10)  p. .  	 
\bibitem[Harary ()]{b3}\label{b3} 	 		‘The Number of Complete Cycles in a Communication Network’.  		 			F Harary 		,  		 			RossI 		.  	 	 		\textit{Journal of Social Psychology}  		1953. 40 p. .  	 
\bibitem[Xu ()]{b19}\label{b19} 	 		‘The use of fuzzy graphs in chemical structure research’.  		 			J Xu 		.  	 	 		\textit{Fuzzy Logic in Chemistry},  				 			D H Rouvry 		 (ed.)  		1997. Academic Press. p. .  	 
\bibitem[Singh ()]{b40}\label{b40} 	 		‘Three-way fuzzy concept lattice representation using neutrosophic set’.  		 			P K Singh 		.  	 	 		\textit{International Journal of Machine Learning}  		2017. 8  (1)  p. .  	 
\bibitem[Broumi et al. ()]{b41}\label{b41} 	 		‘Uniform Single Valued Neutrosophic Graphs’.  		 			S Broumi 		,  		 			A Dey 		,  		 			A Bakali 		,  		 			M Talea 		,  		 			F Smarandache 		,  		 			L H Son 		,  		 			Koleyd 		.  		 \xref{http://dx.doi.org/10.5281/zenodo.1012249}{10.5281/zenodo.1012249}.  		 \url{http://doi.org/10.5281/zenodo.1012249}  	 	 		\textit{Neutrosophic Sets and Systems}  		2017. 17 p. .  	 
\end{bibitemlist}
 			 		 	 
\end{document}
