Families of Disjoint Sets Colouring Technique and Concept of Common and Non Common Vertex

Author(s)	Mansoor ElShiekh Hassan Osman
Country	Sudan
Abstract	Families of disjoint sets colouring technique is trial to generalize all type of colouring, such as edge colouring, vertex colouring, face colouring, sets colouring (partition of sets into families of disjoint sets). In this paper we introduce the concept of common vertex between two cliques and more than two cliques. We introduce some results related to concept of common and non common vertex, and introduce some results explain the number of minimum colour classes not changed after addition or after removal of non common vertex, if maximum clique number is constant. Also in this paper we introduce concept of quasi non common vertex between two cliques and more than two cliques and we introduce some results related to this concept.
Keywords	families of disjoint sets colouring technique, common vertex, non common vertex, quasi non common vertex, proper clique
Field	Mathematics > Logic
Published In	Volume 5, Issue 6, November-December 2023
Published On	2023-11-18
DOI	https://doi.org/10.36948/ijfmr.2023.v05i06.8622
Short DOI	https://doi.org/gs5mhb

About IJFMR Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us		+91-9687-828-838	editor@ijfmr.com

International Journal For Multidisciplinary Research