arXiv (All)
open access
Total Vertex Irregularity Strength of Cubic and 4-Regular Graphs
Let $G$ be a graph and $k$ be a positive integer. A total $k$-labeling of $G$ assigns to each vertex and each edge a label from $\{1,\ldots,k\}$. The weight of a vertex is the sum of its label and the labels of its incident edges. A total labeling is vertex irregular if all vertex weights are distin
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
- Mittelhochdeutsch wurpôz 'radix, bôze 'Flachsbündel', bôz 'Stoss : Geographie und Etymologie#408564
- White Turrets#51362
- Water, from The Four Elements#990983
- Algebraic Subgraph Counting#1155244
- Constructing longer snakes and improved asymptotic bounds in hypercubes#1064027
Record · ID 1078185
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