Editing Glossary of graph theory (section)

==Q==
{{glossary}}

{{term|quasi-line graph}}
{{defn|A quasi-line graph or locally co-bipartite graph is a graph in which the open neighborhood of every vertex can be partitioned into two cliques. These graphs are always [[claw-free graph|claw-free]] and they include as a special case the [[line graph]]s. They are used in the structure theory of claw-free graphs.}}

{{term|quasi-random graph sequence}}
{{defn|A [[quasi-random graph|quasi-random graph sequence]] is a sequence of graphs that shares several properties with a sequence of [[random graphs]] generated according to the [[Erdős–Rényi model|Erdős–Rényi random graph model]].}}

{{term|quiver}}
{{defn|A [[Quiver (mathematics)|quiver]] is a directed multigraph, as used in [[category theory]]. The edges of a quiver are called arrows.}}

{{glossary end}}