GENSPECIALG(1)

💖 GENSPECIALG(1) — the genspecialg page, but make it cute 💖

okay bestie, sit down, hydrate, because we're about to talk about genspecialg (that's version 2.9.3, a User Command, iykyk) and she is literally the graph-generating icon of the group chat. 🎀

---

✨ NAME ✨

genspecialg — the manual page for genspecialg 2.9.3. that's it. that's the name. she's named after herself and honestly? main character energy. 👑

---

🌈 SYNOPSIS 🌈

genspecialg [-s|-g|-z|-d|-v] [-q] [graph options]... [outfile]

---

🦋 DESCRIPTION 🦋

Generate special graphs.

that's the whole vibe. you feed her some graph options, she generates special graphs. periodt. 💅

---

💅 OPTIONS 💅

🌸 General Options 🌸

these are the "how do you want your output served" girlies.

• -s — write in sparse6 format. this is the default, so if you say nothing at all, this is what you get. no thoughts, just sparse6. ✨
• -g — write in graph6 format.
• -z — make digraph versions and write in digraph6 format. the z is for zesty directed edges, probably. 🔥
• -d — write in dreadnaut format. can be used together with -z, so that's a collab. 🤝
• -v — for each graph, report the size to stderr. nosy queen behavior and we respect it. 👀
• -q — suppress summary. shhh. 🤫

---

🎀 Special Options 🎀

bestie, listen. if an option is defined, the digraph version shows up in <angle brackets>, like this: <like this>. and # is the size parameter, called n in the descriptions. so when you see -p#, that # is your n. ok? ok. let's go. 💖

• -p# — path <directed path> on n vertices. a little line of besties holding hands. 🫶
• -c# — cycle <directed cycle> on n vertices. the path but she came back around. the circle of life. 🌸
• -e# — empty graph <digraph with loops only> on n vertices. nothing happening except the loops. hermit era. 🙈
• -k# — complete graph <with loops> on n vertices. everyone is friends with everyone. no one is left out. 💜
• -b#,#[,#] — complete bipartite graph <directed l->r> on n vertices, minus a matching of given size if present. so the third number, if you give one, is that matching size. two friend groups, one bridge situation. 🌈
• -m#,#... — multipartite graph. as many parts as you want, keep adding numbers, she can handle it. 👑
• -a# — antiprism <directed antiprism> on 2n. yes, twice as many, she's extra. ⭐
• -l# — moebius ladder <directed cycle, undirected rungs> with # vertices. note that here the count is just # vertices, not doubled. cute. 🎀
• -D#,# — de Bruijn graph <digraph>. D(m,t) has order m^t. math slay. 🔥
• -w# — wheel with # spokes <directed out from hub>. vroom. 🛞✨
• -f# — flower snark on 4n vertices. flower snark is genuinely the cutest name in graph theory and i will not be taking questions. 🌸💀
• -L# — triangular graph, the linegraph of K_n.
• -P#,# — generalized Petersen graph; the usual one is -P5,2. that's the one everybody uses, so if you were wondering, there you go. 💫
• -Q#, -Q#,# — hypercube on 2^n vertices. Q(n,t) has vertices {0,1}^n and edges for hamming distance t. t=1 is the default. so -Q# alone means t=1, and -Q#,# lets you pick your own t. 🧊
• -A# — connected antiregular graph on n vertices.
• -J#,# — Johnson graph J(n,k), and the args are n and k. in that order. 🫶
• -K#,#, -K#,#,# — Generalized Kneser graph. K(n,k,t) is the graph of k-subsets of an n-set whose intersection is t. the default for t is 0. so the two-arg version is just the t=0 version. ✨
• -C[,#] — circulant <di>graph; the first arg is the number of vertices. that first number is mandatory, the comma one is optional. 💅
• -T[,#] — theta <di>graph Theta(#,#,...), and you give it the path lengths. plural. as many as you want. 🌈
• -G[,#] — <directed> grid. use negative values for open directions. negative = open, no cap. 🕸️
• -Y# — Paley graph or digraph, depending on the size. Nondeterministic. so like, don't be surprised when it's not the same twice, that's literally the documented vibe. 🎲
• -X# — produce a named graph. # can be an index or a partial name. use genspecialg --Xhelp for a list. yes, --Xhelp, that's the flag, go look. 🔍

and bestie, one more thing: any number of graphs can be generated at once. stack those options. she ate. 👑

---

and that's the page!! genspecialg version 2.9.3, from September 2026, written under User Commands. love her, use her, generate responsibly. mwah. 💖🎀🦋