On the maximum size of stepwise irregular graphs

If the degrees of any two consecutive vertices differ by exactly one, the graph is called a stepwise irregular graph. The study of choosing specific vertices in an ordered subset of the vertex set such that no two vertices have the same representations with regard to the chosen subset is known as resolving parameters. This concept has been expanded for edges as well as a combined version of both. We examine a unique unicyclic stepwise irregular graph and an extended structure of stepwise irregular graph in terms of resolvability parameters to connect the stepwise irregular graph and resolving parameter concepts.

show abstract

Bond incident degree indices of stepwise irregular graphs

Adiyanyam

Azjargal

Buyantogtokh

2022

MATH

View full text Add to dashboard Cite

<abstract><p>The bond incident degree (BID) index of a graph $ G $ is defined as $ BID_{f}(G) = \sum_{uv\in E(G)}f(d(u), d(v)) $, where $ d(u) $ is the degree of a vertex $ u $ and $ f $ is a non-negative real valued symmetric function of two variables. A graph is stepwise irregular if the degrees of any two of its adjacent vertices differ by exactly one. In this paper, we give a sharp upper bound on the maximum degree of stepwise irregular graphs of order $ n $ when $ n\equiv 2({\rm{mod}}\;4) $, and we give upper bounds on $ BID_{f} $ index in terms of the order $ n $ and the maximum degree $ \Delta $. Moreover, we completely characterize the extremal stepwise irregular graphs of order $ n $ with respect to $ BID_{f} $.</p></abstract>

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

On the maximum size of stepwise irregular graphs

Cited by 3 publications

References 13 publications

Graphs with maximum irregularity

Graphs with maximum irregularity

Stepwise Irregular Graphs and Their Metric-Based Resolvability Parameters

Bond incident degree indices of stepwise irregular graphs

Contact Info

Product

Resources

About