1 citations · 1 across the 3 of their papers we have counts for
4 papers
Signed graphs and inverses of their incidence matrices
Abdullah Alazemi, Milica Andelic, Sudipta Mallik
The Laplacian matrix of a signed graph may or may not be invertible. We present a combinatorial formula of the Moore-Penrose inverse of . This is achieved by finding a c…
The main vertices of a star set and related graph parameters
Milica Anđelić, Domingos M. Cardoso, Slobodan K. Simi\' c +1
A vertex is called -main if it belongs to a star set of the eigenvalue of a graph and this eigenvalue is main for the graph obtained from $…
Notes on Hamiltonian threshold and chain graphs
Milica Andelic, Tamara Koledin, Zoran Stanic
We revisit results obtained in [F. Harary, U. Peled, Hamiltonian threshold graphs, Discrete Appl.~Math., 16 (1987), 11--15], where several necessary and necessary and sufficient co…
Vertex types in threshold and chain graphs
M. Anđelić, E. Ghorbani, S. K. Simić
A graph is called a chain graph if it is bipartite and the neighborhoods of the vertices in each color class form a chain with respect to inclusion. A threshold graph can be obtain…