arXiv (All)
open access
A construction of F-irregular graphs
For a fixed graph F, the F-degree of a vertex v in a host graph H is the number of subgraphs of H isomorphic to F that contain v, and H is F-irregular if its F-degrees are pairwise distinct. We show that every finite connected graph F on at least three vertices admits a finite connected F-irregular
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
- A 50-Vertex Cubic Counterexample to the Domination-versus-Edge-Domination Conjecture#997773
- Quorum colorings of maximum cardinality in linear time for a subclass of perfect trees#1013364
- Homogenized graphs with spectrally embedded defect states#1118980
- Independencia Funcional, del Adulto Mayor de 60 a 99 Años, en los Hogares de Ancianos, de la Ciudad de Tacna, 2018#1041345
- Paired and semipaired domination in triangulations#923979
Record · ID 984646
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