id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
cana-1260	Mahesh Sarada	Relation Between the Fractional Domination Number of Some Graphs and their Line Graphs	2024	22	.pdf	application/pdf	10636	646	82	Line graph: Line graph of 𝐺 is 𝐿 (𝐺) having its vertices are converted as the edges of original graph 𝐺 with two vertices of graph 𝐿 (𝐺) are adjacent for the condition if corresponding edges share a common vertex in graph 𝐺. Another definition that the vertices of 𝐿 (𝐺) are the edges of graph 𝐺 with two vertices are adjacent whenever the corresponding edges of 𝐺 are adjacent. A subset 𝐷 ⊆ 𝑉 is known as a distance k-domination set of graph 𝐺 if f every 𝑣 ∈ 𝑉 − 𝐷, there exists a vertex 𝑢 ∈ 𝐷 such that 𝑑 (𝑢, 𝑣) ≤ 𝑘.	cache/cana-1260.pdf	txt/cana-1260.txt