4 papers
Degree sum conditions for a graph to have bounded conflict-free connection number
Dinh Hanh Dang, Trung Duy Doan, Pham Hoang Ha +1
A path in an edge-coloured graph is called \emph{conflict-free} if a colour is exclusively applied to one of its edges. A graph is considered \emph{conflict-free connected} if…
The number of cut-edges and conflict-free connection number in planar graphs
Pham Hoang Ha, Dang Dinh Hanh, Vu Quang Minh
A \textit{cut-edge} of a connected graph is an edge whose deletion increases the number of components. In this paper, we first state some conditions for a planar graph to have a fe…
Comparing Methodologies for Ranking Alternatives: A case study in assessing bank financial performance
Dong Trung Chinh, Nguyen Thi Thu Hien, Pham Huong Quynh +1
Bank financial performance encapsulates an institution's capacity to effectively manage its assets, capital, and operational activities to generate profits and ensure stability. Ev…
A Comparative Analysis of Multi-Criteria Decision-Making (MCDM) Methods
Nguyen Thi Thu Hien, Pham Huong Quynh, Vu Quang Minh
Multi-Criteria Decision-Making (MCDM) techniques have found widespread application across diverse fields. The rapid evolution of MCDM has led to the development of hundreds of meth…