k-Intersection Graph of a Finite Set

نویسندگان
Mansoori, Farzaneh ID 1
Esmaeeli, Fahimeh ID 2
Erfanian, Ahmad ID 3

1 Department of Pure Mathematics, Ferdowsi University of Mashhad, International Campus Mashhad, I. R. Iran

2 Department of Pure Mathematics, Ferdowsi University of Mashhad, Mashhad, I. R. Iran

3 Department of Pure Mathematics and The Center of Excellence in Analysis on Algebraic Structures, Ferdowsi University of Mashhad, Mashhad, I. R. Iran

doi
10.22052/mir.2020.208185.1178
چکیده

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.

کلیدواژه‌ها
intersection graph, k-intersection graph, diameter