%0 Journal Article
%T k-Intersection Graph of a Finite Set
%J Mathematics Interdisciplinary Research
%I University of Kashan
%Z 2538-3639
%A Esmaeeli, Fahimeh
%A Erfanian, Ahmad
%A Mansoori, Farzaneh
%D 2019
%\ 12/01/2019
%V 4
%N 2
%P 305-317
%! k-Intersection Graph of a Finite Set
%K intersection graph
%K k-intersection graph
%K diameter
%R 10.22052/mir.2020.208185.1178
%X 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. ﬁnally we investigate their adjacency matrices.
%U https://mir.kashanu.ac.ir/article_102613_b205b739f72772023b0d554c0ed5cdc2.pdf