On Eccentric Connectivity Index of Eccentric Graph of Regular Dendrimer

Nagar, Atulya K.; Sriram, S.

doi:10.1007/s11786-016-0259-z

Cited by 3 publications

(4 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3 ⌋ + 4, otherwise Definition 3.15. [16] Let k and n be positive integers. Dendrimer graphs D k,n are constructed by adding k degree-one vertices to the vertices with degree one in the graph D k,0 , initially defined as D 0 , for a total of n repetitions.…”

Section: Figure 7 E 5 3 Graphmentioning

confidence: 99%

See 1 more Smart Citation

Geodetic Domination Integrity of Thorny Graphs

Onur,

Bacak Turan

2024

Journal of New Theory

View full text Add to dashboard Cite

The concept of geodetic domination integrity is a crucial parameter when examining the potential damage to a network. It has been observed that the removal of a geodetic set from the network can increase its vulnerability. This study explores the geodetic domination integrity parameter and presents general results on the geodetic domination integrity values of thorn ring graphs, $n$-sunlet graphs, thorn path graphs, thorn rod graphs, thorn star graphs, helm graphs, $E_p^t$ tree graphs, dendrimer graphs, spider graphs, and bispider graphs, which are the frequently used graph classes in the literature.

show abstract

Section: Figure 7 E 5 3 Graphmentioning

confidence: 99%

“…Definition 3.18. [16] A regular dendrimer graph is a tree consisting of a central vertex v and each non-pendant vertex has a degree d two or more. In regular dendrimers, the distance from the central vertex to each pendant vertex is called the radius and is denoted by k. Regular dendrimer graphs are denoted by T k,d .…”

Section: Figure 7 E 5 3 Graphmentioning

confidence: 99%

Geodetic Domination Integrity of Thorny Graphs

Onur,

Bacak Turan

2024

Journal of New Theory

View full text Add to dashboard Cite

show abstract

“…Aesthetics-oriented translation principles), when the specific language form and content of the original text are equally important, it is also mentioned that semantic translation is needed when it has nothing to do with the type of the original text. When translating such texts, the primary function of news text is to convey information that cannot be ignored [9].…”

Section: English Semantic Translation Theorymentioning

confidence: 99%

Feature Extraction of English Semantic Translation Relying on Graph Regular Knowledge Recognition Algorithm

Yang

2023

IJCAI

View full text Add to dashboard Cite

Under the background of big data, people are not only pursuing the quantity but also the accuracy of knowledge in acquiring knowledge, especially for English. Because of the ambiguity, variety, and irregularity of English translation, people's reading has brought a lot of trouble. This paper aims to study the feature extraction of English semantic translation and suggests a recognition algorithm that relies on graph common knowledge. Through the analysis of graph regularization and the construction of the model, the recognition algorithm is improved, and the feature extraction methods are compared and analyzed. At the same time, experiments are intended to investigate the improvement of the English semantic translation of the improved recognition algorithm after feature extraction. The experimental results in this paper show that the improved English semantic translation has increased by 10%-15% in terms of translation accuracy. This degree of improvement has great application significance in actual English semantic translation.Povzetek: Opisana je raziskava izboljšav angleškega semantičnega prevoda z uporabo izboljšanega algoritma prepoznavanja značilnosti.

show abstract

“…[6,11,13,14,16]. Finally, different derived graphs have been proposed based on the eccentricity such as radial graphs [7] or the recently introduced graphs with a bit unfortunate name "eccentric graphs" (which are not eccentric graphs in the above sense) [12].…”

Section: Introductionmentioning

confidence: 99%

Simplified constructions of almost peripheral graphs and improved embeddings into them

Klavžar

Narayankar

et al. 2018

Filomat

View full text Add to dashboard Cite

The center and the periphery of a graph are the sets of vertices with minimum and maximum eccentricity, respectively. A graph is called almost peripheral (AP) if all its vertices but one lie in the periphery. The rAP index AP r (G) of a graph G is the smallest number of vertices needed to add to G to obtain an rAP graph in which G lies as an induced subgraph. In this paper new, simplified constructions of AP graphs are presented. It is proved that if r ≥ 2 and n ≥ 2, then AP r (K n) ≤ 4r − 3. Moreover, if G is not complete and has at least three vertices, then AP r (G) ≤ 4r − 4. In this way the previously best know bound AP r (G) ≤ 4r − 2 is improved.

show abstract

On Eccentric Connectivity Index of Eccentric Graph of Regular Dendrimer

Cited by 3 publications

References 6 publications

Geodetic Domination Integrity of Thorny Graphs

Geodetic Domination Integrity of Thorny Graphs

Feature Extraction of English Semantic Translation Relying on Graph Regular Knowledge Recognition Algorithm

Simplified constructions of almost peripheral graphs and improved embeddings into them

Contact Info

Product

Resources

About