Algorithms for connected p-centdian problem on block graphs
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-0058-0
Abstract: We consider the facility location problem of locating a set $$X_p$$Xp of p facilities (resources) on a network (or a graph) such that the subnetwork (or subgraph) induced by the selected set $$X_p$$Xp is connected.… read more here.
Keywords: algorithms connected; block graphs; problem; connected centdian ... See more keywords
On the inverse eigenvalue problem for block graphs
Sign Up to like & getrecommendations! Published in 2021 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2021.09.008
Abstract: The inverse eigenvalue problem of a graph G aims to find all possible spectra for matrices whose (i, j)-entry, for i 6= j, is nonzero precisely when i is adjacent to j. In this work,… read more here.
Keywords: graphs; eigenvalue problem; block graphs; inverse eigenvalue ... See more keywords
Krull dimension and regularity of binomial edge ideals of block graphs
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Algebra and Its Applications"
DOI: 10.1142/s0219498820501339
Abstract: We give a lower bound for the Castelnuovo-Mumford regularity of binomial edge ideals of block graphs by computing the two distinguished extremal Betti numbers of a new family of block graphs, called flower graphs. Moreover,… read more here.
Keywords: edge ideals; ideals block; block graphs; regularity ... See more keywords