Results 271 to 280 of about 258,952 (290)
Some of the next articles are maybe not open access.

RUPTURE DEGREE AND MIDDLE GRAPHS

2012
Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructible if they do get disrupted. These desirable properties of networks can be measured by various parameters like connectivity, toughness, integrity, tenacity and scattering number.
Odabaş Z.N., Aytaç A.
openaire   +3 more sources

Algebraic connectivity of the line graph, the middle graph and the total graph of a regular graph

Ars Comb., 2003
The algebraic connectivity \(a(G)\) of an undirected graph \(G\) is the second smallest eigenvalue of its Laplacian matrix \(L(G)=D(G)-A(G)\), where \(D(G)\) is the diagonal matrix of vertex degrees and \(A(G)\) is the adjacency matrix of \(G\). Let \(\Lambda (G)\), \(M(G)\) and \(T(G)\) denote the line graph, the middle graph and the total graph of a ...
openaire   +1 more source

On characterizations of the middle graphs

TRU Mathematics, 1975
AKIYAMA, JIN   +2 more
openaire   +2 more sources

Graph equations for line graphs, total graphs and middle graphs

TRU Mathematics, 1976
AKIYAMA, JIN   +2 more
openaire   +2 more sources

On the Diameter of Middle Graphs and Total Graphs

International Journal of Mathematics Trends and Technology, 2018
Keerthi G. Mirajkar   +1 more
openaire   +1 more source

Miscellaneous properties of middle graphs

TRU Mathematics, 1974
AKIYAMA, JIN   +2 more
openaire   +2 more sources

Radio number for middle graph of dandelion

Journal of Discrete Mathematical Sciences and Cryptography, 2021
exaly  

Home - About - Disclaimer - Privacy