Clique Number and Girth of the Rough Ideal-Based Rough Edge Cayley Graph

B. Praba () and X. A. Benazir Obilia ()
Additional contact information
B. Praba: Department of Mathematics, SSN College of Engineering, Chennai 603110, India
X. A. Benazir Obilia: Department of Mathematics, SSN College of Engineering, Chennai 603110, India

New Mathematics and Natural Computation (NMNC), 2019, vol. 15, issue 03, 479-487

Abstract: In this paper, clique number and girth of the rough ideal-based rough edge Cayley graphs G(T(J)) and G(T(Ĵ)), where J is the rough Ideal of the rough semiring (T,Δ,∇) and Ĵ contains the nontrivial elements of J, are evaluated. We prove that the clique number of G(T(Ĵ)) is m+1 and the clique number of G(T(J)) is m+2. Girth of G(T(Ĵ)) and G(T(J)) is 3. These concepts are illustrated with examples.

Keywords: Rough set; rough ideal; Cayley graph; clique number; girth (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S1793005719500273
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:nmncxx:v:15:y:2019:i:03:n:s1793005719500273

Ordering information: This journal article can be ordered from

DOI: 10.1142/S1793005719500273

Access Statistics for this article

New Mathematics and Natural Computation (NMNC) is currently edited by Paul P Wang

More articles in New Mathematics and Natural Computation (NMNC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().