Authors: Das, Kinkar Chandra, Çevik, Ahmet Sinan
Contributors: Uludağ Üniversitesi/Fen-Edebiyat Fakültesi/Matematik Anabilim Dalı., orcid:0000-0002-0700-5774, orcid:0000-0003-2576-160X, Cangül, İsmail Naci, J-3505-2017, 57189022403
Subject Terms: Mathematics, Graph, Spanning trees, Independence number, Clique number, First Zagreb index, Molecular-orbitals, Zagreb indexes, applied, Signless Laplacian, Eigenvalue, Signed Graph
File Description: application/pdf
Relation: TUBİTAK; Makale - Uluslararası Hakemli Dergi; Uludağ Üniversitesi; Journal of Inequalities and Applications; Yurt içi; Yurt dışı; Das, K. C. vd. (2013). “The number of spanning trees of a graph”. Journal of Inequalities and Applications, 2013.; https://doi.org/10.1186/1029-242X-2013-395; http://hdl.handle.net/11452/32849; 000336908800001; 2-s2.0-84894413510; 2013
Contributors: Uludağ Üniversitesi/Mühendislik Fakültesi/Endüstri Mühendisliği Bölümü., orcid:0000-0002-6260-0162, İnkaya, Tülin, AAH-2155-2021, 24490728300
Subject Terms: Spectral clustering, Similarity graph, K-nearest neighbor, Epsilon-neighborhood, Fully connected graph, Construction, Density, Computer science, Engineering, Operations research & management science, Clustering algorithms, Graph theory, Motion compensation, Nearest neighbor search, Spectrum analysis, Adaptive neighborhood, Connected graph, Connectivity information, K nearest neighbor (KNN), K-nearest neighbors, Minimum spanning trees, Trees (mathematics), artificial intelligence, electrical & electronic, Cluster Analysis, Laplacian Matrix
Relation: Makale - Uluslararası Hakemli Dergi; Expert Systems with Applications; İnkaya, T. (2015). "A parameter-free similarity graph for spectral clustering". Expert Systems with Applications, 42(24), 9489-9498.; https://doi.org/10.1016/j.eswa.2015.07.074; https://www.sciencedirect.com/science/article/pii/S0957417415005345?via%3Dihub; http://hdl.handle.net/11452/28604; 000362857500010; 2-s2.0-84942333236; 9489; 9498; 42; 24