Some Results on Pendant Regular Graphs
Let G = (V, E) be a simple connected graph with o(G) = n and s(G) = m. A graph with pendant vertices is called Pendant Graphs or simply P-Graphs. In this paper we define the regularity of Pendant Graphs w.r.t. the degrees of support vertex of each pendant vertices. Sufficient conditions for pendant...
Main Authors: | Suji Elizabeth Mathew, Sunny Joseph Kalayathankal |
---|---|
Format: | Article |
Language: | English |
Published: |
Mathyze Publishers
2023-11-01
|
Series: | Pan-American Journal of Mathematics |
Online Access: | https://mathyze.com/index.php/pajm/article/view/130 |
Similar Items
-
THE VERTEX DISTANCE COMPLEMENT SPECTRUM OF SUBDIVISION VERTEX JOIN AND SUBDIVISION EDGE JOIN OF TWO REGULAR GRAPHS
by: Ann Susa Thomas, et al.
Published: (2021-07-01) -
On some related concepts n-cylindrical fuzzy neutrosophic topological spaces
by: Sarannya R, et al.
Published: (2023-03-01) -
Pendant and isolated vertices of comaximal graphs of modules
by: Kukil Kalpa Rajkhowa, et al.
Published: (2022-12-01) -
Distance irregularity strength of graphs with pendant vertices
by: Faisal Susanto, et al.
Published: (2022-04-01) -
Some Results about the Contractions and the Pendant Pairs of a Submodular System
by: Saeid Hanifehnezhad, et al.
Published: (2019-10-01)