Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2804772
Jump to:navigation, search

zbMath1349.05195MaRDI QIDQ2804772

Mukaddes Ökten, Tufan Turaci

Publication date: 4 May 2016


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

connectivitynetwork design and communicationMycielski graphsgraph vulnerabilityresidual closeness


Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Connectivity (05C40)


Related Items

The vulnerability of some networks including cycles via domination parameters, The average lower reinforcement number of a graph, Link Residual Closeness of Harary Graphs, Computing closeness for some graphs, Computational complexity of network vulnerability analysis, On the residual closeness of graphs with cut vertices, Additional Closeness of Cycle Graphs, Network robustness and residual closeness, A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs, Robustness of Regular Caterpillars, Additional Closeness and Networks Growth



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2804772&oldid=15709190"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 18:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki