Improved Upper Bounds for the Cyclic Anti-Bandwidth Number of Two Graphs

Improved upper bounds for the cyclic anti-bandwidth number of can_445.mtx (CAB ≤ 109) and nos6.mtx (CAB ≤ 330), with mechanically verified certificates and executable verification scripts in the public evidence repository (https://github.com/iafiscal1212/torc-evidence).

Authors

Carmen Esteban (ORCID: https://orcid.org/0009-0009-8062-5492)

Publication Details

Journal: Zenodo (CERN European Organization for Nuclear Research)
Published: 2026-10-30
DOI: https://doi.org/10.5281/zenodo.23786302
Primary Topic: Graph Labeling and Dimension Problems
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Improved Upper Bounds for the Cyclic Anti-Bandwidth Number of Two Graphs

Carmen Esteban

Oct 30, 2026

Zenodo (CERN European Organization for Nuclear Research)

Graph Labeling and Dimension Problems

article

Improved Upper Bounds for the Cyclic Anti-Bandwidth Number of Two Graphs

Carmen Esteban

October 30, 2026article en

Abstract

Zenodo (CERN European Organization for Nuclear Research)

Openalex Percentile: Top 14%

Graph Labeling and Dimension Problems

DOI Open Access PDF OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon

Improved Upper Bounds for the Cyclic Anti-Bandwidth Number of Two Graphs — Carmen Esteban · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS