DELPTG(1)

💖 DELPTG — the manual page for delptg 2.9.3 💖

okay bestie, sit down, hydrate, and let me tell you about delptg — she's a section 1 user command and she's literally here to delete vertices from your graphs. no cap. 🦋

---

✨ SYNOPSIS ✨

delptg [-lq] [-a|-b] [-d#|-d#:#] [-v#|-v#:#] [-A] [-r#] [-k#] [-n#]
[-m#|-i] [infile [outfile]]

---

🌸 DESCRIPTION 🌸

Delete some vertices from a file of graphs. That's the whole assignment, and she ate. 💅

Two things you need to know before we even get into the flags, because they're the vibe of the whole program:

• The output file has a header if and only if the input file does. Matchy matchy. If your input came with a header, your output gets one too; if it didn't, it doesn't. 🎀
• No isomorph reduction is done. Zero. None. Not her job, not her problem. 🙈

💫 OPTIONS 💫

• -l — Canonically label the outputs. Give them that glow-up. ✨
• -d#, -d#:# — Only remove vertices whose original degree falls in the given range. Degree filter, but make it fashion. 📏
• -k# — Find the #-core. That means recursively yeeting every vertex of degree less than k until nothing else qualifies. Like peeling a friendship group down to the real ones. 👑
• -n# — The number of vertices to delete. Default is 1, because sometimes you just want to remove one (1) problem. 🍓
• -A — Delete all the vertices specified by -d and/or -v. Go off, honestly. 💀
• -v#, -v#:# — The vertex number (or numbers) that it's allowed to delete. Heads up: the first vertex is number 0. Zero-indexed girlies stay winning. 🧚
• -m# — A lower bound on the minimum degree of the output graphs. Keeping the survivors from being lonely. 🫶
• -r# — Choose # random sets of points. Note: they are not necessarily different. Chaos is permitted. 🔥
• -S# — Set the random number seed. If you don't, she just takes it from the clock like a menace. ⏰
• -a — The deleted points must be adjacent. They have to be friends. 🫂
• -b — The deleted points must be non-adjacent. They must not be friends. Enemies to lovers pipeline, denied. 😭
• -i — Leave the deleted vertices as isolates instead of fully removing them. Not compatible with -m. Pick a lane, bestie. 🚧

---

⚠️ THE FINE PRINT (still iconic, still important) ⚠️

No empty graphs are output. Ever. Not happening.

And here's the shady part: no warning is issued if -d, -v, -n and -m together imply that no graphs are going to be output. She will simply produce nothing and say nothing. Silent treatment. 💀

For digraphs, out-degree is what gets used for -d and -m. Remember that. It's giving directed, it's giving specific. 🌈

• -q — Suppress auxiliary information. Shhh. Quiet mode. 🤫

---

🎀 SEE YA 🎀

That's the whole page, bestie — every flag, every default, every little caveat, all of it. Go forth and delete responsibly. 💖

delptg 2.9.3 · September 2026 · DELPTG(1) — periodt. 💅✨