@article {
author = {Esmaeeli, Fahimeh and Erfanian, Ahmad and Mansoori, Farzaneh},
title = {k-Intersection Graph of a Finite Set},
journal = {Mathematics Interdisciplinary Research},
volume = {4},
number = {2},
pages = {305-317},
year = {2019},
publisher = {University of Kashan},
issn = {2538-3639},
eissn = {2476-4965},
doi = {10.22052/mir.2020.208185.1178},
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. ﬁnally we investigate their adjacency matrices.},
keywords = {intersection graph,k-intersection graph,diameter},
url = {https://mir.kashanu.ac.ir/article_102613.html},
eprint = {https://mir.kashanu.ac.ir/article_102613_b205b739f72772023b0d554c0ed5cdc2.pdf}
}