Results 191 to 200 of about 211,399 (214)
Distance Spectral Radius of Some k-partitioned Transmission Regular Graphs
The distance matrix of a simple graph G is $$DG=d_{i,j}$$, where $$d_{i,j}$$ is the distance between the ith and jth vertices of G. The distance spectral radius of G, written $$\lambda _{1}G$$, is the largest eigenvalue of DG. We determine the distance spectral radius of the wheel graph $$W_{n}$$, a particular type of spider graphs, and the generalized
Fouzul Atik, Pratima Panigrahi
openaire +2 more sources
Generalized distance spectral radius of some t-partitioned transmission regular graphs
Let [Formula: see text] be an [Formula: see text]-vertex connected graph with the distance matrix [Formula: see text] and the diagonal matrix of transmissions [Formula: see text]. The generalized distance matrix of a connected graph [Formula: see text] is [Formula: see text], where [Formula: see text], [Formula: see text].
Aditi Howlader, Pratima Panigrahi
openaire +2 more sources
Sławomir Bujnowski +2 more
openaire +2 more sources
The method of determining of transmission properties of networks based on regular graphs topology
Ledziński, Damian +2 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Hematology and oncology clinical care during the coronavirus disease 2019 pandemic
Ca-A Cancer Journal for Clinicians, 2020Manish A Shah +2 more
exaly

