English edit

Etymology edit

Blend of rectangle +‎ graph

Noun edit

rectagraph (plural rectagraphs)

  1. (graph theory) A triangle-free connected graph where any two vertices have 0 or 2 common neighbors.
    • 2015, Joanna B. Fawcett, “Locally triangular graphs and normal quotients of the  -cube”, in arXiv[1]:
      Such graphs are known to be halved graphs of bipartite rectagraphs, which are connected triangle-free graphs in which every  -path lies in a unique quadrangle.