A graph G is said to be DQS if there is no other non-isomorphic graph with the same signless Laplacian spectrum as G. Let k, ti (1 ≤ i ≤ k), and s be natural numbers. A path-friendship graph, Gs,t1...,tk, is a graph of order n = 2s + t1 + ... + tk+1 which consists of s triangles and k paths of lengths t1,t2 ..., tk sharing a common vertex. In this paper, we show that these graphs are DQS and using this result, we respond to a conjecture in [F. Wen, Q. Huang, X. Huang and F. Liu, The spectral characterization of wind-wheel graphs, Indian J. Pure Appl. Math. [ABSTRACT FROM AUTHOR]