Title of article
k-Intersection Graph of a Finite Set
Author/Authors
Esmaeeli, Fahimeh Department of Pure Mathematics - Ferdowsi University of Mashhad , Erfanian, Ahmad Department of Pure Mathematics and The Center of Excellence in Analysis on Algebraic Structures - Ferdowsi University of Mashhad , Mansoori, Farzaneh Department of Pure Mathematics - Ferdowsi University of Mashhad - International Campus Mashhad
Pages
13
From page
305
To page
317
Abstract
For any nonempty set Ω and k-subset Λ, the k-intersection graph, denoted by Γm(Ω,Λ), is an undirected simple graph whose vertices are all m-subsets of Ω and two distinct vertices A and B are adjacent if and only if A∩B ⊈ Λ. In this paper, we determine diameter, girth, some numerical invariants and planarity, Hamiltonian and perfect matching of these graphs. finally we investigate their adjacency matrices.
Keywords
Intersection graph , k-intersection graph
Serial Year
2019
Record number
2494573
Link To Document