Integrity of total graphs via certain parameters
From MaRDI portal
Publication:556589
DOI10.1023/B:MATN.0000049665.92885.26zbMATH Open1063.05114OpenAlexW1978237591MaRDI QIDQ556589FDOQ556589
Publication date: 21 June 2005
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:matn.0000049665.92885.26
Recommendations
combinatorial optimizationgraph theoryneural networkcommunication networkgraph connectivitynetwork stability
Cited In (10)
- Domination integrity of some graph classes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Integrity of total transformation graphs
- Title not available (Why is that?)
- Faithfulness in chain graphs: the discrete case
- Title not available (Why is that?)
- Domination integrity of splitting graph of path and cycle
- Walking on vertices and edges by continuous-time quantum walk
- Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs
This page was built for publication: Integrity of total graphs via certain parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q556589)