書(shū)目名稱(chēng)Graph Theory Singapore 1983影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Graph Theory Singapore 1983網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Graph Theory Singapore 1983網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Graph Theory Singapore 1983被引頻次
書(shū)目名稱(chēng)Graph Theory Singapore 1983被引頻次學(xué)科排名
書(shū)目名稱(chēng)Graph Theory Singapore 1983年度引用
書(shū)目名稱(chēng)Graph Theory Singapore 1983年度引用學(xué)科排名
書(shū)目名稱(chēng)Graph Theory Singapore 1983讀者反饋
書(shū)目名稱(chēng)Graph Theory Singapore 1983讀者反饋學(xué)科排名
作者: Factual 時(shí)間: 2025-3-21 22:07 作者: Commodious 時(shí)間: 2025-3-22 00:36 作者: PALL 時(shí)間: 2025-3-22 05:12 作者: 抱怨 時(shí)間: 2025-3-22 09:54
Equalities involving certain graphical distributions, Capobianco. He defines the geodesic distribution (gd) of a connected graph as (g.,g.,g.,...), where g. is the number of pairs of vertices having i shortest paths (geodesics) between them. We discuss gd(G) and examine its relationships to dd(G) and nd(G).作者: collagenase 時(shí)間: 2025-3-22 15:24 作者: collagenase 時(shí)間: 2025-3-22 19:10
Cycles in abelian cayley graphs with a proscribed vertex,all the vertices of M and which avoids all the vertices of N. Let G be a group generated by a subset X of G. We denote by G(X) the graph whose vertices are elements of G and two vertices a, b are adjacent if and only if a. e X U X.. The graph G(X) is known as a .. For an abelian group G of order p, 作者: 高興一回 時(shí)間: 2025-3-23 00:35 作者: nettle 時(shí)間: 2025-3-23 02:14 作者: COWER 時(shí)間: 2025-3-23 07:07 作者: 贊美者 時(shí)間: 2025-3-23 11:53
Some definitions of central structures,stance sum. The nature of the facility to be constructed (such as a pipeline) could necessitate selecting a structure (such as a path) rather than just a point at which to locate the facility. Similarly, the facility may be required to "service" structures or areas within the network, and not just p作者: Intellectual 時(shí)間: 2025-3-23 16:55
Equalities involving certain graphical distributions,e another. The common neighbor distribution (nd) is (n.,n.,n.,...,n.), where n. is the number of pairs of vertices having i common neighbors. These and other sequences have been introduced recently as tools in distinguishing pairs of nonisomorphic graphs (dd(G) works best for graphs of large diamete作者: Myelin 時(shí)間: 2025-3-23 20:27
A collection of sets related to the tutte polynomial of a matroid,of "internally passive" elements, and for each forest, or independent set, F, there is a unique basis B such that ψ(B) ? F ? B. In the context of matroids generally, we examine the structure of the collection of sets {ψ(B) : B is a basis}, particularly looking at the sequence of numbers of these set作者: 花束 時(shí)間: 2025-3-24 01:10
https://doi.org/10.1007/3-540-29490-2 Woodrow [7] : if the arcs of a tournament are two-colored, then there exists some vertex which is reachable from every other vertex via a monochromatic path. Next, as illustrative of the proof of a more technical result, it is shown that with one exception every 3-connected tournament contains two 作者: WAX 時(shí)間: 2025-3-24 02:35 作者: GUILT 時(shí)間: 2025-3-24 07:33 作者: nocturnal 時(shí)間: 2025-3-24 12:31
Giorgio Pietramaggiori,Saja Schereres. Variants of the puzzle include a 4 × 4 × 4 cube and a 3 × 4 × 5 brick. In this paper, we show how to construct all k × . × m bricks with small sets of different pieces. A defective cube is a cube with one of its unit cubes missing. We show that every 2. × 2. × 2. defective cube can be constructe作者: 象形文字 時(shí)間: 2025-3-24 16:53
https://doi.org/10.1007/978-3-642-00897-9or rejecting each of the lines of G with independent probability p or q=1?p, respectively. Since RG(p) is the outcome of a random process, RG(p) is called a . G and is studied with the appropriate probabilistic considerations..We derive some general properties of RG(p). In particular, we obtain the 作者: 牙齒 時(shí)間: 2025-3-24 22:14
https://doi.org/10.1007/978-1-4471-5280-4stance sum. The nature of the facility to be constructed (such as a pipeline) could necessitate selecting a structure (such as a path) rather than just a point at which to locate the facility. Similarly, the facility may be required to "service" structures or areas within the network, and not just p作者: 誘拐 時(shí)間: 2025-3-25 01:53 作者: 恫嚇 時(shí)間: 2025-3-25 03:49 作者: Yourself 時(shí)間: 2025-3-25 10:04 作者: 側(cè)面左右 時(shí)間: 2025-3-25 13:18 作者: 恃強(qiáng)凌弱 時(shí)間: 2025-3-25 19:36 作者: Preserve 時(shí)間: 2025-3-25 20:16
https://doi.org/10.1007/978-3-030-19007-1G(X) has the property C(p?1,1) if and only if G(X) is neither cyclic nor bipartite, which in turn, is equivalent to G(X) being hamilton-connected. Moreover, if G(X) is bipartite of order 2t but not cyclic, then G(X) has the property C(t?1,1) but not C(t,1). If G(X) is cyclic then it is not C(m,1) for any m.作者: 同來(lái)核對(duì) 時(shí)間: 2025-3-26 01:51 作者: 色情 時(shí)間: 2025-3-26 06:39
Cycles in abelian cayley graphs with a proscribed vertex,G(X) has the property C(p?1,1) if and only if G(X) is neither cyclic nor bipartite, which in turn, is equivalent to G(X) being hamilton-connected. Moreover, if G(X) is bipartite of order 2t but not cyclic, then G(X) has the property C(t?1,1) but not C(t,1). If G(X) is cyclic then it is not C(m,1) for any m.作者: Ointment 時(shí)間: 2025-3-26 11:47 作者: Ibd810 時(shí)間: 2025-3-26 14:10 作者: 財(cái)政 時(shí)間: 2025-3-26 19:57 作者: 光滑 時(shí)間: 2025-3-26 21:48 作者: 你正派 時(shí)間: 2025-3-27 01:09 作者: 填滿(mǎn) 時(shí)間: 2025-3-27 06:45 作者: lobster 時(shí)間: 2025-3-27 13:05 作者: 越自我 時(shí)間: 2025-3-27 17:33
General connectivity,nimum cardinality of Z ? Y such that X - Z ? P. Clearly graph connectivity (resp. line-connectivity) is the special case X=G=(V,E), Y=V(resp. E), and P=connected. Illustrations for groups, numbers, and graphs are given, including the following:作者: 訓(xùn)誡 時(shí)間: 2025-3-27 20:46 作者: 災(zāi)難 時(shí)間: 2025-3-28 00:52 作者: CAB 時(shí)間: 2025-3-28 04:18
Minimally Invasive Surgery in OrthopedicsIn this paper, some general properties of the binding number of product graphs are obtained. Also given are some formulas and limit properties of the binding number of the product of some special graphs.作者: 親密 時(shí)間: 2025-3-28 07:42 作者: 考得 時(shí)間: 2025-3-28 13:50 作者: Extricate 時(shí)間: 2025-3-28 15:42 作者: VOC 時(shí)間: 2025-3-28 19:56
Computational complexity of graph properties,We prove some general properties are elusive, generalize some results on the Aanderaa-Rosenberg conjecture, find some necessary conditions for certain properties to be non-elusive and produce some non-elusive properties.作者: 嚴(yán)厲譴責(zé) 時(shí)間: 2025-3-29 02:45
The binding number of product graphs,In this paper, some general properties of the binding number of product graphs are obtained. Also given are some formulas and limit properties of the binding number of the product of some special graphs.作者: 祝賀 時(shí)間: 2025-3-29 06:26 作者: Original 時(shí)間: 2025-3-29 11:06
Graph factors with given properties,We present a sufficient condition for a graph to have a (g,f)-factor which contains p given edges but does not contain other q given edges, where g and f are integer-valued functions defined on the vertices of the graph.作者: 發(fā)炎 時(shí)間: 2025-3-29 13:07
Graph Theory Singapore 1983978-3-540-38924-8Series ISSN 0075-8434 Series E-ISSN 1617-9692 作者: 喚醒 時(shí)間: 2025-3-29 16:25
Hollylynne S. Leelatory mechanisms, ranging from cultural autonomy, through regional self-governance, to . sovereignty. Protection of ethnic and national minorities by means of autonomy arrangements (of all kinds) did not begun until the twentieth century. The challenge of ethno-nationalism and the so-called ‘minori作者: Acetaminophen 時(shí)間: 2025-3-29 22:22 作者: jettison 時(shí)間: 2025-3-30 03:34
ClaSP: An Efficient Algorithm for Mining Frequent Closed Sequences,k ben?tigte man metallische Leiter- werkstoffe zum Aufbau eines Stromkreises sowie dielektrische Werkstoffe zur Isolation der Leitungen und zur Speicherung elektrischer Ladung. Mit der Entdeckung der Verknüpfung von elektrischen und magnetischen Erscheinungen begann der Einsatz magnetischer Werkstof作者: DEAWL 時(shí)間: 2025-3-30 07:51 作者: 性上癮 時(shí)間: 2025-3-30 10:30 作者: beta-carotene 時(shí)間: 2025-3-30 15:19 作者: CHART 時(shí)間: 2025-3-30 20:28
The Development of a Diachronic Perspective in Children evolving process and to conceive of the continuity of the process. Five experiments were conducted to study the development of diachronic thinking in 8- to 11-year-old children in different domains. Each of the 290 subjects, interviewed individually, was required to draw or describe or order past a作者: Electrolysis 時(shí)間: 2025-3-30 23:15 作者: Mundane 時(shí)間: 2025-3-31 03:49 作者: 他姓手中拿著 時(shí)間: 2025-3-31 05:13 作者: Statins 時(shí)間: 2025-3-31 11:30
ngen des Krisenmanagements ergeben. Detailreich und zugleich pr?gnant werden die Ursachen der europ?ischen Strukturkrise beleuchtet, ein chronologischer überblick über die bisherige Entwicklung gegeben und schlie?lich der Wandel und die zukünftigen Probleme der Europ?ischen Union aufgrund der Euro-Krise diskutiert.?.978-3-658-02452-9作者: Hyperalgesia 時(shí)間: 2025-3-31 13:35
Jens Spars?,Steve Furber challenges and perspectives to the global table. The chapter includes a discussion of the progressive recognition of cities and city networks as global political actors and how they contribute to new forms of multi-level and networked global governance. It further reflects on the main trends and hi作者: 偶然 時(shí)間: 2025-3-31 18:13
Real-Time Communication Alert System for Missing Vessels in Deep Sea,is used for localizing the vessels in deep sea. Information theory-based parameter selection is used for finding the parameter that influences the movement of the missing vessel and predicting the location to which missing vessel has drifted toward. Knowledge of past trajectories of the vessel is al作者: 停止償付 時(shí)間: 2025-4-1 01:27 作者: corpuscle 時(shí)間: 2025-4-1 03:31 作者: medieval 時(shí)間: 2025-4-1 06:10
Book 2017Latest editionown set of differing states and internal processes. The interactions between elements in the simulation represent interactions in the target systems. What makes this "social" is that it can represent an observed society..Social systems include all those systems where the components have individual a作者: 知道 時(shí)間: 2025-4-1 10:53
