Some exact values for p(t, d)

Swadi, Suaad Abdulrazzaq; Najim, Alaa A.; Swadi, Khawla Abdul Razzaq

doi:10.1080/09720529.2020.1714889

Search citation statements

Order By: Relevance

Paper Sections

Select...

Preliminary1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

2024

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If there is no path connecting 𝑢 and 𝑣 , 𝑑 𝐺 (𝑢, 𝑣) = ∞ . The greatest distance in a graph 𝐺 is known as its diameter, denoted by the symbol 𝑑, such that 𝑑 = 𝑚𝑎𝑥(𝑑 𝐺 (𝑢, 𝑣)) and 𝑢, 𝑣 ∈ 𝑉(𝐺) [9].…”

Section: Preliminarymentioning

confidence: 99%

Solving Edges Deletion Problem of Generalized Petersen Graphs

Nasif Jasim,

Najim

2024

Jour. Kufa Math. Comp.

View full text Add to dashboard Cite

The dependability and effectiveness of a network can be investigated using a variety of graph-theoretic techniques, and the network's connectivity determines how reliable it is. Diameter in a network is often used to measure the efficiency of a network in the event that a network experiences issues such as a decline in the communication signal or a breakdown in the communication between its components. This paper examines the increase in diameter of the generalized Petersen graph after removing a certain number of edges. Finding the exact values of f(n,t) that represent the maximum diameter of an altered generalized Petersen graph GP(n,k,t) obtained after removing edges from for k=1 and t≥2.

show abstract

Section: Preliminarymentioning

confidence: 99%