Back to Search
Start Over
Clique Number and Girth of the Rough Ideal-Based Rough Edge Cayley Graph
- Source :
- New Mathematics and Natural Computation. 15:479-487
- Publication Year :
- 2019
- Publisher :
- World Scientific Pub Co Pte Lt, 2019.
-
Abstract
- In this paper, clique number and girth of the rough ideal-based rough edge Cayley graphs [Formula: see text] and [Formula: see text], where [Formula: see text] is the rough Ideal of the rough semiring [Formula: see text] and [Formula: see text] contains the nontrivial elements of [Formula: see text], are evaluated. We prove that the clique number of [Formula: see text] is [Formula: see text] and the clique number of [Formula: see text] is [Formula: see text]. Girth of [Formula: see text] and [Formula: see text] is 3. These concepts are illustrated with examples.
- Subjects :
- Ideal (set theory)
Cayley graph
Applied Mathematics
020206 networking & telecommunications
02 engineering and technology
Girth (graph theory)
Edge (geometry)
Computer Science Applications
Semiring
Human-Computer Interaction
Combinatorics
Computational Mathematics
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
Computational Theory and Mathematics
ComputingMethodologies_DOCUMENTANDTEXTPROCESSING
0202 electrical engineering, electronic engineering, information engineering
020201 artificial intelligence & image processing
Rough set
ComputingMilieux_MISCELLANEOUS
Clique number
MathematicsofComputing_DISCRETEMATHEMATICS
Mathematics
Subjects
Details
- ISSN :
- 17937027 and 17930057
- Volume :
- 15
- Database :
- OpenAIRE
- Journal :
- New Mathematics and Natural Computation
- Accession number :
- edsair.doi...........cadfa0f89ee5c7805f58764eb6cb3399
- Full Text :
- https://doi.org/10.1142/s1793005719500273