Tenacity of total graphs
From MaRDI portal
Publication:2929635
DOI10.1142/S012905411450021XzbMATH Open1303.05166MaRDI QIDQ2929635FDOQ2929635
Authors: Yinkui Li, Zongtian Wei, Xiaokui Yue, Erqiang Liu
Publication date: 14 November 2014
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph operations (line graphs, products, etc.) (05C76) Communication networks in operations research (90B18)
Cites Work
Cited In (16)
- Bounds for different spreads of line and total graphs
- On the first-order edge tenacity of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quasi-Laplacian energy of \(\psi\)-sum graphs
- Title not available (Why is that?)
- Edge Rupture Degree of Graphs
- Tenacity and the maximum network
- Neighbor Isolated Tenacity of Graphs
- Computing the tenacity of some graphs
- A note on ``Tenacity of a graph with maximum connectivity
- On networks with maximum graphical structure and tenacity \(T\)
- Tenacity of complete graph products and grids
- Tenacity and rupture degree of permutation graphs of complete bipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Tenacity of total graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929635)