--- title: Generalized Circular Chord Graphs url: https://www.emergentmind.com/topics/generalized-circular-chord-graphs type: topic --- # Generalized Circular Chord Graphs Generalized circular chord graphs form a family of graph models in which cyclic order on a circle—or on one or several rings—governs adjacency, intersection, coloring, or metric structure. The umbrella includes classical circle graphs, where vertices correspond to chords and adjacency records chord intersection; split and circular-arc restrictions of those models; fixed-offset chorded cycles such as \(\mathcal C_n^{(k)}\); ring and multi-ring families built from modular chord rules; and surface-based interlace graphs arising from chord diagrams of immersed loops. Across these formulations, the common theme is that a circular ordering yields rigid matrix patterns, parity constraints, and often strong algorithmic or spectral structure [2007.00570][2509.05845][2409.00520][2310.08806]. ## 1. Core definitions and scope Classically, a graph \(G=(V,E)\) is a circle graph if there exists a set of chords \(\mathcal C\) on a circle and a bijection \(\phi:V\to\mathcal C\) such that \[ uv\in E \iff \phi(u)\cap \phi(v)\neq\emptyset. \] In probabilistic work, a chord diagram of size \(n\) is a pairing of \(2n\) labeled points on a circle, and its intersection graph is defined by chord crossings. In fixed-offset cyclic work, generalized circular chord graphs \(\mathcal C_n^{(k)}\) are graphs on \(\mathbb Z_n\) with cycle edges, chords of length \(k\), and, when \(n\) is even, diameters. In network-oriented work, chordal ring, chordal multi-ring, and mixed variants place vertices on one or several cycles and add parity-dependent modular chords. In topological work, a chordiagraph is the interlace graph of a chord diagram associated with a filoop on a surface [2007.00570][1501.01489][2509.05845][2409.00520][2310.08806]. These definitions encode different emphases. In circle graphs and random chord-diagram models, the central relation is geometric intersection of chords. In \(\mathcal C_n^{(k)}\), chordal rings, and maximal outerplanar triangulations, the central datum is cyclic distance along the boundary or along a modular cycle. In filoop and Gauss-diagram settings, the same chord combinatorics is enriched by orientation, framing, or genus. This suggests that “generalized circular chord graphs” is best understood as a research umbrella rather than a single canonical graph class. A recurring neighboring notion is the split graph \(G=(K,S)\), where \(K\) induces a clique and \(S\) an independent set. Another is the circular-arc graph, defined as the intersection graph of arcs on a circle. These subclasses are important because the circular order then interacts with clique–stable decompositions or interval representations in especially rigid ways. ## 2. Structural characterizations in restricted subclasses Within split graphs, circle-graph recognition admits a forbidden induced subgraph characterization. If \(\mathcal F\) denotes the family consisting of tent \(\vee K_1\), odd \(k\)-suns with center, even \(k\)-suns, the matrix-defined families \(M_{II}(k)\), \(M_{III}(k)\), \(M_{IV}\), \(M_V\), and the families \(F_0\), \(F_1(k)\), \(F_2(k)\), then a split graph is a circle graph if and only if it contains none of the graphs in \(\mathcal F\) as an induced subgraph; every member of \(\mathcal F\) is minimally non-circle. The structural analysis proceeds by fixing induced tent, 4-tent, or co-4-tent configurations and partitioning \(K\) and \(S\) so that vertices of \(S\) acquire circularly monotone neighborhoods in ordered clique blocks [2007.00570]. A distinct but closely related line concerns split graphs inside circular-arc graphs. McConnell’s transformation associates to a chordal graph \(G\) and clique \(K\) a graph \(G^K\). In the split case, \(G\) is circular-arc if and only if there exists \(s\in S\) such that \(H=G^{N[s]}\) is an interval graph with an interval model in which no interval for a vertex in \(N(s)\) contains an interval for a vertex in \(K\setminus N(s)\). For Helly circular-arc split graphs the criterion simplifies to: \(G\) is Helly circular-arc if and only if \(G^K\) is interval. This yields explicit minimal split obstructions, including the long-claw-derived and whipping-top-derived graphs, the families \(S^1_k\) and \(S^2_k\), and the graphs \(\overline{S_k}^+\) obtained by adding a vertex complete to the clique side of \(\overline{S_k}\) [2403.01947]. These characterizations are sharply subclass-specific. A full forbidden induced subgraph characterization of all circle graphs is still unknown. The split obstruction list also does not extend verbatim even to all chordal graphs: the graph \(A''_3\) is chordal but neither split nor circle, so additional obstructions are needed outside the split setting. ## 3. Matrix formalisms and recognition methods A major methodological theme is the translation of circular geometry into matrix structure. For a split graph \(G=(K,S)\), the incidence matrix \(A(S,K)\) records adjacency between the stable and clique sides. A matrix is nested if its columns can be permuted so that every row has the consecutive-ones property and any two rows are either disjoint or nested; equivalently, it contains no 0-gem subconfiguration \[ \begin{pmatrix} 1&1&0\\ 0&1&1 \end{pmatrix}. \] Circle-graph constraints inside split graphs require the richer notion of an enriched 2-nested matrix, with LR-labeled rows, block bi-coloring, LR-orderings, and exclusion of several local subconfiguration families together with monochromatic or badly colored gem patterns. These conditions encode precisely when chord endpoints can be placed on a circle so that crossings reproduce adjacency [2007.00570]. On the algorithmic side, classical circle-graph recognition already has Naji’s algebraic characterization, yielding an \(O(n^7)\) algorithm, and an almost-linear-time recognition algorithm due to Geelen, Paul, Tedder, and Corneil. In the split subclass, the forbidden-family and 2-nestedness machinery imply polynomial-time recognition. For split circular-arc graphs, the interval-pattern viewpoint goes further: a linear-time certifying recognition algorithm either outputs a circular-arc model or an induced minimal obstruction, using the transformation \(G^{N[s]}\), interval recognition, and explicit obstruction lifting [2403.01947]. Realizability of Gauss diagrams leads to a parallel algebraic formalism over \(GF(2)\). If \(M\) is the adjacency matrix of the circle graph of a Gauss diagram, realizability is equivalent to the existence of a diagonal matrix \(\Lambda\) such that \(M+\Lambda\) is idempotent, or, equivalently, to solvability of \[ (\alpha_i+\alpha_j)m_{ij}=\langle m_i,m_j\rangle+m_{ij}. \] In graph-theoretic terms, the circle graph must be Eulerian and its edge weights \(\omega(ij)=|N(i)\cap N(j)| \bmod 2\) must satisfy the weighted cycle condition \(\sum_{e\in C}\omega(e)\equiv |C|\pmod 2\) for every cycle. The resulting recognition procedure checks parity on non-adjacent pairs and reduces the remaining constraints to bipartiteness of an auxiliary graph [2108.02873]. ## 4. Random, extremal, and enumerative phenomena Uniform random chord diagrams provide the canonical probabilistic model. A chord diagram of size \(n\) is a perfect matching on \([2n]\), chosen uniformly among \[ (2n-1)!!=\frac{(2n)!}{2^n n!} \] possibilities, and its intersection graph is \(G_n\). If \(D(n)=\deg(c_1)/n\) for the chord containing endpoint \(1\), then \[ \mathbb P(D(n)\le b)\to 1-\sqrt{1-2b} \quad\text{for }0\le b\le \tfrac12. \] For \(k^2=o(n)\), the \(k\)-core is, with high probability, exactly the subdiagram \(L_{\ge k}\) of chords of length at least \(k\). Fixed-length counts satisfy \(L_j\xrightarrow{d}\mathrm{Pois}(1)\), the number of trivial strong components in a random orientation converges to \(\mathrm{Pois}(3)\), and, with high probability, the evolving diagram becomes monolithic and then stays monolithic [1501.01489]. A different extremal theme studies cyclic distance rather than intersection. In a maximal outerplanar graph drawn on an outer cycle \(\mathcal C=v_1v_2\dots v_n v_1\), each non-cycle edge is a chord of combinatorial length \[ \ell(v_iv_j)=\min\{|j-i|,\,n-|j-i|\}, \] and the total chord length is \[ \mathrm{TCL}(G)=\sum_{e\notin E(\mathcal C)}\ell(e). \] For \(3\cdot 2^k\le n\le 3\cdot 2^{k+1}\), the minimum is \[ \operatorname{minTCL}(n)=n(k+2)-3\cdot 2^{k+1}, \] achieved by the greedy graphs \(G_n\). The maximum is \[ \operatorname{maxTCL}(n)= \begin{cases} \frac{n^2-9}{4}, & n \text{ odd},\\[4pt] \frac{n^2-8}{4}, & n \text{ even}, \end{cases} \] achieved by the shell graphs \(S_n\). A maximal outerplanar graph has maximal total chord length if and only if it has exactly two ears, and every integer between the minimum and maximum values occurs as the total chord length of some maximal outerplanar graph of order \(n\) [2404.11028]. Enumeration results expose the size of the realizable subclass. The number of realizable circle graphs on \(n\) crossings is \[ 1,1,2,3,7,18,41,123,361,1257,4573 \] for \(n=3,\dots,13\), and these graphs coincide with alternating prime knots modulo mutation. The meander subclass, obtained from open meanders by closing with a chord that intersects all others, has idempotent adjacency matrix \(M^2=M\); the corresponding counts of meander graphs are \[ 1,2,5,13,43,167 \] at \(n=3,5,7,9,11,13\) [2108.02873]. ## 5. Fixed-offset, circulant, and ring-based families One explicit use of the term generalized circular chord graphs defines \(\mathcal C_n^{(k)}\) on vertex set \(\mathbb Z_n\) by adjoining to the cycle \(C_n\) all edges \((i,i+k \bmod n)\) and, when \(n\) is even, all diameters \((i,i+n/2 \bmod n)\). For fixed \(k\) and number of colors \(q\), the chromatic counts satisfy \[ P(\mathcal C_n^{(k)},q)=\operatorname{tr}(A_{k,q}^n) \] for a finite transfer matrix \(A_{k,q}\). In the case \(k=3\) and odd \(n\), the exact formula is \[ P(\mathcal C_n^{(3)},3)=L_n+2\cos\!\left(\frac{2\pi n}{3}\right)+2s_n+2, \] where \(L_n\) is the Lucas sequence and \(s_{n+3}=-s_{n+2}-s_n\). Consequently, \[ P(\mathcal C_n^{(3)},3)=\varphi^n+O(\rho^n) \] with \(\rho\approx 1.466<\varphi\). For even \(n=2m\), diameter constraints are handled by a paired-window transfer matrix \(\widehat A\) of size at most \(144\times 144\), and the resulting counts exhibit modular patterns across residue classes without universal vanishing rules [2509.05845]. Network-oriented generalizations replace one circle by one or several rings with modular chord rules. The undirected chordal ring \(CR(N,c)\) and chordal multi-ring \(CMR(m,n,c)\) are 3-regular and bipartite, while the mixed families \(CRM(N,c)\) and \(CMRM(m,n,c)\) replace ring edges by directed arcs and keep one undirected chord per vertex. Plane tessellations of the infinite patterns yield order-diameter bounds. For \(CR\), the maximum number of vertices of diameter \(k\) is \(\frac{3k^2+1}{2}\) for odd \(k\) and \(\frac{3k^2}{2}\) for even \(k\); for even \(k\), \(CMR\!\left(\frac{k}{2},3k,3\right)\) attains \(\frac{3k^2}{2}\). In the mixed case, the corresponding upper bound is \(\frac{(k+1)^2}{2}\) for odd \(k\) and \(\frac{k(k+2)}{2}\) for even \(k\). These families are also lifts over Abelian groups, which leads to closed formulas for the adjacency spectrum, with undirected spectra parameterized by Fourier modes and mixed spectra generally complex [2409.00520]. These fixed-offset and multi-ring models supply concrete applications. The \(k=3\) coloring formulas are presented as feasibility engines for cyclic scheduling problems such as airline gate assignment, wireless sensor networks, and multiprocessor task coordination. Chordal rings and multi-rings are used as interconnection-network topologies in which all nodes lie on one or several cycles. A plausible implication is that “generalized circular chord graphs” has become a meeting point between transfer-matrix combinatorics, network design, and circulant spectral theory. ## 6. Topological and minor-theoretic extensions Generalization to surfaces replaces planar chord diagrams by framed chord diagrams coming from filoops, that is, generic immersions of a circle in a closed oriented surface whose complement is a disjoint union of discs. The interlace graph of such a chord diagram is called a chordiagraph. For graphs of even degrees, the quantity \(\ming(G)\) gives the minimal genus among filoops having interlace graph \(G\); in the bicolourable case, \[ \ming(G)=\frac12\min_\chi \operatorname{rank}(\mathcal R+\mathcal B_\chi), \] where \(\mathcal R=\mathsf E+\mathsf E^2\) is the Rosenstiehl form. The case \(\ming(G)=0\) characterizes Gaussian graphs, precisely those interlace graphs that admit genus-0 framings and hence spheriloops; if \(G\) is connected and Gaussian, every chord diagram with interlace graph \(G\) has exactly two genus-0 framings [2310.08806]. The same surface framework supports canonical factorization. Spheric sums correspond to disjoint unions of interlace graphs, while essential plumbings correspond to splits in the Cunningham decomposition of a connected graph. The genus is additive under both operations, and Gaussian graphs can be generated by an unambiguous context-sensitive grammar built from CL2- and CL12-weighted graph-labelled trees. This places generalized circular chord graphs inside an operadic picture in which local complementation, split decomposition, and genus interact systematically. A complementary direction studies circle graphs and more general circular drawings through treewidth. Large-treewidth circle graphs contain induced subgraphs formed by \(t\) vertex-disjoint cycles \(C_1,\dots,C_t\) such that every vertex of \(C_i\) has at least two neighbours in \(C_j\) for \(i