Asymptotically large (Δ,D)-graphs.
Graphs with maximum degree Δ, diameter D and orders greater than (Δ/α)D, for a constant α<2, are proved to exist for infinitely many values of Δ and for D larger than a fixed value.
সংরক্ষণ করুন:
| প্রধান লেখক: | |
|---|---|
| অন্যান্য লেখক: | |
| বিন্যাস: | article |
| ভাষা: | ইংরেজি |
| প্রকাশিত: |
2005
|
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | https://www.sciencedirect.com/science/article/pii/S0166218X05001332 https://hdl.handle.net/20.500.12008/51336 |
| ট্যাগগুলো: |
কোনো ট্যাগ নেই, প্রথমজন হিসাবে ট্যাগ করুন!
|
অনুরূপ উপাদানগুলি: Asymptotically large (Δ,D)-graphs.
- Superfluous edges and exponential expansions of De Bruijn and Kautz graphs
- Network reliability analysis and intractability of counting diameter crystal graphs
- On the application of graph neural networks for indoor positioning systems.
- Diameter-constrained reliability : theory and applications
- Domination Invariant of a Diameter Constrained Network Reliability Model
- Global Synchronization Properties for Different Classes of Underlying Interconnection Graphs for Kuramoto Coupled Oscillators