Results 71 to 80 of about 1,105 (94)

Distance Matrix of a Class of Completely Positive Graphs: Determinant and Inverse

Special Matrices, 2020
A real symmetric matrix A is said to be completely positive if it can be written as BBt for some (not necessarily square) nonnegative matrix B. A simple graph G is called a completely positive graph if every matrix realization of G that is both ...
Das Joyentanuj, Jayaraman Sachindranath, Mohanty Sumit   +2 more
doaj   +1 more source

The general position problem and strong resolving graphs

Open Mathematics, 2019
The general position number gp(G) of a connected graph G is the cardinality of a largest set S of vertices such that no three pairwise distinct vertices from S lie on a common geodesic.
Klavžar Sandi, Yero Ismael G.
doaj   +1 more source

Computational analysis for eccentric neighborhood Zagreb indices and their significance. [PDF]

Heliyon, 2023
Ahmed H, Saleh A, Ismail R, M RS, Alameri A.   +4 more
europepmc   +1 more source

Symmetries and symmetry-breaking in arithmetic graphs. [PDF]

Heliyon, 2023
Shah A, Javaid I, Rehman SU.
europepmc   +1 more source

Strong edge geodetic problem in networks

Open Mathematics, 2017
Geodesic covering problems form a widely researched topic in graph theory. One such problem is geodetic problem introduced by Harary et al. [Math. Comput. Modelling, 1993, 17, 89-95].
Manuel Paul, Klavžar Sandi, Xavier Antony, Arokiaraj Andrew, Thomas Elizabeth   +4 more
doaj   +1 more source

Comparative Study of Planar Octahedron Molecular Structure via Eccentric Invariants. [PDF]

Molecules, 2023
Chu ZQ, Ali H, Ali DA, Nadeem M, Kirmani SAK, Ali P.   +5 more
europepmc   +1 more source

Four-point condition matrices of edge-weighted trees

Special Matrices
Formulas for the determinant of distance matrix DT{D}_{T} of tree TT are known in the unweighted case and in the case when the edges of TT have commuting variable weights. Associated with the four-point condition (4PC) and a tree TT are two matrices, the
Azimi Ali, Jana Rakesh, Nagar Mukesh K., Sivasubramanian Sivaramakrishnan   +3 more
doaj   +1 more source

Biochemical phenotyping of paroxysmal nocturnal hemoglobinuria reveals solute carriers and β-oxidation deficiencies. [PDF]

PLoS One, 2023
Yamakawa PE, Fonseca AR, Guerreiro da Silva IDC, Gonçalves MV, Marchioni DM, Carioca AAF, Michonneau D, Arrais-Rodrigues C.   +7 more
europepmc   +1 more source

On the spectral radius and energy of the degree distance matrix of a connected graph

Open Mathematics
Let GG be a simple connected graph on nn vertices. The degree of a vertex v∈V(G)v\in V\left(G), denoted by dv{d}_{v}, is the number of edges incident with vv and the distance between any two vertices u,v∈V(G)u,v\in V\left(G), denoted by duv{d}_{uv}, is ...
Khan Zia Ullah, Hameed Abdul
doaj   +1 more source

Comparing the excepted values of atom-bond connectivity and geometric-arithmetic indices in random spiro chains. [PDF]

J Inequal Appl, 2018
Wei S, Ke X, Hao G.
europepmc   +1 more source