On endomorphism-regularity of (n, n + 1)-graphs

The aim of this paper is to investigate End-regularity of [Formula: see text]-graphs which are connected graphs with [Formula: see text] vertices and [Formula: see text] edges. This class of graphs includes all graphs consisting of two cycles connected by a path (bicycle graphs) and also graphs cons...

Full description

Saved in:
Bibliographic Details
Main Authors: A. Rajabi, A. Erfanian
Format: Article
Language:English
Published: Taylor & Francis Group 2025-05-01
Series:AKCE International Journal of Graphs and Combinatorics
Subjects:
Online Access:https://www.tandfonline.com/doi/10.1080/09728600.2024.2434069
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The aim of this paper is to investigate End-regularity of [Formula: see text]-graphs which are connected graphs with [Formula: see text] vertices and [Formula: see text] edges. This class of graphs includes all graphs consisting of two cycles connected by a path (bicycle graphs) and also graphs consisting of two cycles with a common path (eight graphs). We consider these kinds of graphs and provide answers regarding their End-regularity. Moreover, we consider the case where these classes have one or more pendant vertices and investigate their End-regularity.
ISSN:0972-8600
2543-3474