Computing closeness for some graphs (Q6152844): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2478/ausi-2023-0015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4389617128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4998600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closeness centrality in some splitting networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3158579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closeness of Splitting Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2804772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5355027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Residual Closeness in Cycles and Related Networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:08, 26 August 2024

scientific article; zbMATH DE number 7804163
Language Label Description Also known as
English
Computing closeness for some graphs
scientific article; zbMATH DE number 7804163

    Statements

    Computing closeness for some graphs (English)
    0 references
    0 references
    0 references
    13 February 2024
    0 references
    0 references
    graph vulnerability
    0 references
    closeness
    0 references
    Mycielski graph
    0 references
    tadpole graph
    0 references
    0 references