Graph operations and neighbor rupture degree
DOI10.1155/2013/836395zbMATH Open1271.90016DBLPjournals/jam/KandIlcIBP13OpenAlexW2083101853WikidataQ59004743 ScholiaQ59004743MaRDI QIDQ364548FDOQ364548
Authors: Saadet Kandİlcİ, Goksen Bacak-Turan, Refet Polat
Publication date: 9 September 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/836395
Recommendations
Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25) Communication networks in operations research (90B18)
Cites Work
- Title not available (Why is that?)
- Graph theory with applications
- Title not available (Why is that?)
- Handbook of Graph Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Vertex-neighbor-integrity of powers of cycles
- Neighbor rupture degree and the relations between other parameters.
- Rupture degree of graphs
Cited In (7)
- Neighbor rupture degree of total graphs and their complements
- Neighbor rupture degree and the relations between other parameters.
- Neighbor rupture degree of transformation graphs \(G^{xy-}\)
- Graph operations and neighborhood polynomials
- Construction of Petersen graph via graph product and correlation of topological descriptors of Petersen graph in terms of cyclic graph C5
- Neighbor toughness of graphs
- Neighbor rupture degree of Harary graphs
This page was built for publication: Graph operations and neighbor rupture degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q364548)