পদ্ধতির তুলনা করুন

	ডিগ্রি সেন্ট্রালিটি	সান্নিধ্য কেন্দ্রীয়তা
ক্ষেত্র	নেটওয়ার্ক বিশ্লেষণ	নেটওয়ার্ক বিশ্লেষণ
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	1978	1950 (formalized 1979)
প্রবর্তক	Freeman, L. C.	Bavelas, A.; formalized by Freeman, L. C.
ধরন	Node-level centrality measure	Node-level centrality index
মৌলিক উৎস	Freeman, L. C. (1978). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239.	Freeman, L. C. (1979). Centrality in social networks: Conceptual clarification. Social Networks, 1(3), 215–239.
অপর নাম	node degree, degree score, DC, connectivity centrality	closeness, farness-based centrality, geodesic closeness, normalized closeness centrality
সম্পর্কিত	6	6
সারসংক্ষেপ	Degree centrality is the simplest and most intuitive measure of a node's importance in a network, defined as the number of direct ties a node has to other nodes. Normalized by dividing by the maximum possible ties, it allows comparison across networks of different sizes and is the starting point of almost every network analysis.	Closeness centrality measures how quickly a node can reach all others in a network by computing the inverse of its average shortest-path distance to every other node. First described by Bavelas (1950) and formally unified by Freeman (1979), it identifies nodes that can spread information or resources efficiently across the entire graph — not merely nodes with many direct contacts.