arXiv (All)
open access
On infinite families of $[P_n]$-irregular graphs
This paper presents the first systematic study of $[F]$-irregular graphs, a concept that parallels classical $F$-irregularity. For a fixed graph $F$, a graph $G$ is $[F]$-irregular if the numbers of its induced subgraphs isomorphic to $F$ containing a given vertex are pairwise distinct for all verti
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Degree-square Turán problem for two self-converse tournaments#1155982
- Jg.33.2026,Nr.7/8#683758
- Jg. 73.2026, Nr. 9#658659
- Jg. 74.2026, Nr. 33#624104
- Jg.32.2026, 9#683747
Record · ID 1051111
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive