NBRHOODG(1)

✨ NAME ✨

okay bestie, say hi to nbrhoodg — it's literally the manual page for nbrhoodg version 2.9.3 💖 (and yeah it lives in section 1, the User Commands manual, iykyk)

---

🌸 SYNOPSIS 🌸

nbrhoodg [-lq] [-c|-C] [-d#|d#:#] [-v#|-v#:#] [infile [outfile]]

like... that's the whole vibe. one command, a bunch of little flags, and optionally an input file and an output file 🎀

---

🦋 DESCRIPTION 🦋

so what does it DO?? it extracts neighbourhoods of vertices of a graph. that's it, that's the job 💅

few things you need to know before we get into the flags, no cap:

• the output file has a header if and only if the input file has one. matching energy only ✨
• no isomorph reduction is done. none. zero. it is not that girl today 🙈
• no null graphs are written. if it's empty, it's not showing up. periodt.

---

🎀 the options 🎀

• -l — canonically label the outputs. the default is just keeping the same labelling as the input, so this is you choosing chaos (well, canonical chaos) 💫
• -C — extract closed neighbourhoods instead. a lil upgrade, we love her 🫶
• -c — extract non-neighbourhoods instead. the opposite of the thing. iconic honestly 💀
• -D# — extract neighbourhoods out to distance #. note that this one implies -C, so it's closed neighbourhoods out to that distance, bestie 🌈
• -d#, -d#:# — only include vertices whose original degree falls in the given range. single value or a range, your call 🍓
• -v#, -v#:# — only include vertices with these vertex numbers. heads up: the first one is 0, so count like a programmer not like a person 😭
• -q — suppress auxiliary information. quiet mode, mysterious mode, main character mode 👑

also important, bestie: no empty graphs are output. and for digraphs, it's the out-degree and out-neighbourhoods that get used, so keep that in mind 🧚

---

that's the whole page fr fr. this lil beauty is nbrhoodg version 2.9.3, dated September 2026 💜 mwah, go extract some neighbourhoods, you got this ⭐