Share Your Research, Maximize Your Social Impacts
Some extremal problems in (d,d+1)-regular graphs
Journal: International Journal of Mathematics and Soft Computing (Vol.6, No. 2)Publication Date: 2016.07.24
Authors : N Murugesan; R Anitha;
Page : 105-110
Keywords : degree sequence; – regular graphs; semiregular graph.;
Source : Download
Find it from : Google Scholar
Abstract
By (d, d+1) - regular graph, we mean a graph whose vertices are all having degree either d or d+1. Two graphs are said to be sequentially equivalent (SE) if they have the same degree sequence. In this paper, we discuss some extremal problems of general (d, d+1) -regular graphs, and SE (d, d+1) - regular graphs.
Other Latest Articles
- Upper vertex covering number and well covered semigraphs
- Infinite multi-series arising from generalized q-alpha difference equation
- Recurrence relation on the number of spanning trees of generalized book graphs and related family of graphs
- Cordial labeling in the context of Duplication of some graph elements
- Broadcasting in Bloom Graph
Last modified: 2017-08-30 19:49:57