On extension of regular graphs
From MaRDI portal
Publication:5031864
DOI10.1080/09720529.2015.1085740zbMath1481.05031arXiv1509.05476OpenAlexW2964172119MaRDI QIDQ5031864
Saptarshi Bej, Anirban Banerjee
Publication date: 16 February 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.05476
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Connectivity (05C40) Vertex degrees (05C07)
Related Items (2)
On the vertex irregular reflexive labeling of several regular and regular-like graphs ⋮ Coloring Sums of Extensions of Certain Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On maximum matchings in almost regular graphs
- Matchings in regular graphs from eigenvalues
- Hamiltonian cycles in random regular graphs
- Counting colorings of a regular graph
- Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
- A new 5‐arc‐transitive cubic graph
This page was built for publication: On extension of regular graphs