Results 191 to 200 of about 211,012 (212)

Distance Spectral Radius of Some k-partitioned Transmission Regular Graphs

2016
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   +1 more source

Generalized distance spectral radius of some t-partitioned transmission regular graphs

Asian-European Journal of Mathematics
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   +1 more source

Balancing transmission properties in regular and irregular graph-based networks by controlling transmission resources

2023 16th International Conference on Signal Processing and Communication System (ICSPCS), 2023
Sławomir Bujnowski, Zbigniew Lutowski, Adam Flizikowski   +2 more
openaire   +1 more source

The method of determining of transmission properties of networks based on regular graphs topology

Zeszyty Naukowe, Telekomunikacja i Elektronika, Scientific Journal, Telecommunications and Electronics, 2014
Ledziński, Damian, Śmigiel, Sandra, Śrutek, Mścisław   +2 more
openaire   +1 more source

Regular Splitting Graph Network for 3D Human Pose Estimation

IEEE Transactions on Image Processing, 2023
Md. Tanvir Hassan, Abdessamad Ben Hamza
exaly  

Transmissibility and transmission of respiratory viruses

Nature Reviews Microbiology, 2021
Nancy H L Leung
exaly  

Manifold-ranking based retrieval using k-regular nearest neighbor graph

Pattern Recognition, 2012
Bin Wang
exaly  

There is no (95, 40, 12, 20) strongly regular graph

Journal of Combinatorial Designs, 2020
Jernej Azarija, Tilen Marc
exaly  

Tight Lower Bounds on the Size of a Maximum Matching in a Regular Graph

Graphs and Combinatorics, 2007
Anders Yeo
exaly