intTypePromotion=1
zunia.vn Tuyển sinh 2024 dành cho Gen-Z zunia.vn zunia.vn
ADSENSE

Arbitrary graph

Xem 1-7 trên 7 kết quả Arbitrary graph
  • Advanced Computer Networks: Lecture 45. This lecture will cover the following: global internets; diameter of the internet; internet structure today; multiple backbone service providers; arbitrary graph structure; virtual geographies; scaling problems for the internet; IP address hierarchy evolution;...

    ppt485p haoasakura 30-05-2022 15 3   Download

  • In this paper, we describe the structure of the cyclic module in the weighted Leavitt path algebra of reducible weighted graph generated by the elements in the induced graph. In module theory, the structure of a module or the structure of a submodule is commonly described.

    pdf5p viwilliamleiding 10-12-2021 10 1   Download

  • Graphlets are useful for bioinformatics network analysis. Based on the structure of Hocevar and ˇ Demšar’s ORCA algorithm, we have created an orbit counting algorithm, named Jesse. This algorithm, like ORCA, uses equations to count the orbits, but unlike ORCA it can count graphlets of any order.

    pdf13p vicoachella2711 27-10-2020 5 0   Download

  • Let E be an arbitrary directed graph and let L be the Leavitt path algebra of the graph E over a field K . The necessary and sufficient conditions are given to assure the existence of a maximal ideal in L and also the necessary and sufficient conditions on the graph that assure that every ideal is contained in a maximal ideal are given.

    pdf10p danhdanh27 08-01-2019 23 1   Download

  • A graph G = (V, E) is r-equitably k-colorable if there exists a partition of V into k independent sets V1, V2, · · · , Vk such that | |Vi| − |Vj | | ≤ r for all i, j ∈ {1, 2, · · · , k}. In this note, we show that if two trees T1 and T2 of order at least two are r-equitably k-colorable for r ≥ 1 and k ≥ 3, then all trees obtained by adding an arbitrary edge between T1 and T2 are also r-equitably k-colorable.

    pdf6p vinguyentuongdanh 19-12-2018 15 0   Download

  • The space of embedded minimal surfaces of fixed genus in a 3-manifold II; Multi-valued graphs in disks By Tobias H. Colding and William P. Minicozzi II* 0. Introduction This paper is the second in a series where we give a description of the space of all embedded minimal surfaces of fixed genus in a fixed (but arbitrary) closed 3-manifold. The key for understanding such surfaces is to understand the local structure in a ball and in particular the structure of an embedded minimal disk in a ball in R3 . We show here that if the curvature of such a disk...

    pdf25p tuanloccuoi 04-01-2013 47 6   Download

  • MANET is an autonomous system of mobile routers (and associated hosts) connected by wireless links--the union of which form an arbitrary graph. The routers are free to move randomly and organize themselves arbitrarily; thus, the network's wireless topology may change rapidly and unpredictably. Such a network may operate in a standalone fashion.

    ppt22p nhq_khtn 12-03-2011 67 6   Download

CHỦ ĐỀ BẠN MUỐN TÌM

ADSENSE

nocache searchPhinxDoc

 

Đồng bộ tài khoản
2=>2