Indonesia OneSearch
Gravitasi
  • A graph theoretical analysis o...
  • Lokasi
Cover Image

A graph theoretical analysis of the number of edges in k-dense graphs

Tersimpan di:
Main Authors: Eroh, Linda; Department of Mathematics, University of Wisconsin-Oskhosh, Oshkosh, WI, USA, Escuadro, Henry; Department of Mathematics, Juniata College, Huntingdon, PA, USA, Gera, Ralucca; Department of Applied Mathematics, Naval Postgraduate School, Monterey, CA, USA, Prahlow, Samuel; Department of Mathematics and Statistics, Valparaiso University, Valparaiso, IN, USA, Schmitt, Karl; Department of Mathematics and Statistics, Department of Computer and Information Sciences, Valparaiso University, Valparaiso, IN, USA
Format: Article info application/pdf eJournal
Bahasa: eng
Terbitan: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB , 2016
Subjects:
k-dense subnetworks (or k-dense subgraph)
k-dense community
k-dense graph
k-core
k-core subnetwork
Online Access: http://www.ejgta.org/index.php/ejgta/article/view/113
http://www.ejgta.org/index.php/ejgta/article/view/113/pdf_14
  • Lokasi
  • Deskripsi
  • Daftar Isi
  • Preview
  • Tampilan Petugas

Internet

http://www.ejgta.org/index.php/ejgta/article/view/113
http://www.ejgta.org/index.php/ejgta/article/view/113/pdf_14

Lokasi

Koleksi Electronic Journal of Graph Theory and Applications (EJGTA)
Gedung Indonesian Combinatorial Society
Institusi Indonesian Combinatorial Society
Kota BANDUNG
Provinsi JAWA BARAT
Kontak Butuh informasi lebih lanjut? Hubungi pustakawan institusi ini.

Lihat Juga

  • Modular irregularity strength of dense graphs
    oleh: Suparta, I Nengah; Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Pendidikan Ganesha, et al.
    Terbitan: (2024)
  • On the restricted size Ramsey number for P3 versus dense connected graphs
    oleh: Silaban, Denny Riama; Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Indonesia, et al.
    Terbitan: (2020)
  • Decomposition of complete graphs into connected bipartite unicyclic graphs with eight edges
    oleh: Fahnenstiel, John; Department of Mathematics and Statistics, University of Minnesota Duluth, Duluth, MN 55812, U.S.A., et al.
    Terbitan: (2019)
  • The edge-distinguishing chromatic number of petal graphs, chorded cycles, and spider graphs
    oleh: Fickes, Grant; Department of Mathematics, University of South Carolina, USA, et al.
    Terbitan: (2022)
  • (1, 2)-rainbow connection number at most 3 in connected dense graphs
    oleh: Doan, Trung Duy; School of Applied Mathematics and Informatics, Hanoi University of Science and Technology, Hanoi, Vietnam, et al.
    Terbitan: (2023)
© 2025 Perpustakaan Nasional Republik Indonesia
Loading...