ADDPTG(1)

Heyyy bestie, welcome to the addptg page 🦋 It's filed under User Commands, so you know it's giving official 💅

✨ NAME ✨

Okay so the name section just says addptg - manual page for addptg 2.9.3 🌸 Simple, iconic, no notes.

🎀 SYNOPSIS 🎀

addptg [-lq] [-n#] [-j#:#] [-e#:#] [-ck] [-io] [infile [outfile]]

Ngl the flags are stacked like a whole outfit 👑 Everything in the brackets is optional, and the files are optional too.

💖 DESCRIPTION 💖

Okay bestie, the main job here is adding a specified number of new vertices to your graph ✨ That's it, that's the whole energy 🧚

The output file gets a header if and only if the input file has one. Exact match, no cap 🫶

Here's the flag lineup:

• -l — canonically label the outputs 🏷️
• -c — join each new vertex to all the old vertices 🔗
• -k — make a clique on the set of new vertices 💜
• -n# — the number of new vertices, default is 1 🌱
• -j#, -j#:# — join a new vertex to # old vertices in all possible ways 🧩
• -e#, -e#:# — use all the joins that give the new graphs # edges 🦋

-j, -e, and -D are each incompatible with -n 🙈 Don't mix them up or it'll be a whole mess.

• -D# — upper bound on the maximum (out)degree of the output graphs 📐
• -i — for a digraph, edges go towards the old vertices ⬅️
• -o — for a digraph, edges go away from the old vertices ➡️

-i is the default if neither -i nor -o is given. Main character behavior 👑

• -q — suppress the auxiliary information 🤫

---

Byeee bestie 🫶 That's the whole page! It's addptg version 2.9.3, dated September 2026, filed under ADDPTG(1) 🌈💅