◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

C. Dangalchev

4 papers hereh-index 7397 citations18 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author4

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • cs.DM4

identity via Semantic Scholar / OpenAlex

most citedCloseness Centralities of Lollipop Graphs

4 citations · 6 across the 3 of their papers we have counts for

collaborators

4 papers

cs.DM2026

Closeness and Decision Making

Chavdar Dangalchev

In this article we consider networks, which for a given time period can have one link broken. Which new link should we build so the closeness of the resulting network satisfies som…

cs.DM2023★ 2 cited

Closeness of Some Graph Operations

Chavdar Dangalchev

Closeness is an important measure of network centrality. In this article we will calculate the closeness of graphs, created by using operations on graphs. We will prove a formula f…

cs.DM2023★ 4 cited

Closeness Centralities of Lollipop Graphs

Chavdar Dangalchev

Closeness is one of the most studied characteristics of networks. Residual closeness is a very sensitive measure of graphs robustness. Additional closeness is a measure of growth p…

cs.DM2023

Link Residual Closeness of Harary Graphs

Ch. Dangalchev

The study of networks characteristics is an important subject in different fields, like math, chemistry, transportation, social network analysis etc. The residual closeness is one…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.