作者: 犬儒主義者 時間: 2025-3-21 22:27
On covering the points of a graph with point disjoint paths,termining ζ in the case of a tree, and it is shown that this tree algorithm can be generalized to yield ζ for any connected graph. Degree conditions are also derived which yield simple upper bounds for ζ.作者: PALSY 時間: 2025-3-22 04:20 作者: 護航艦 時間: 2025-3-22 04:59
A class of starter induced 1-factorizations,inct 1-factors is a Hamiltonian circuit. This problem, generalized to K., has arisen in several contexts and the above result strengthens the conjecture of various authors that such 1-factorizations exist on all K.. The first unsettled case is now K..作者: Laconic 時間: 2025-3-22 12:36
https://doi.org/10.1007/978-3-476-02798-6ated and partial results obtained to date are indicated. We conclude with a summary of structures other than trees which have been reconstructed, and some remarks on the reconstruction of countably infinite graphs.作者: 糾纏 時間: 2025-3-22 16:08 作者: 糾纏 時間: 2025-3-22 18:06 作者: anachronistic 時間: 2025-3-22 23:08 作者: 集合 時間: 2025-3-23 02:52 作者: 承認 時間: 2025-3-23 06:28 作者: UNT 時間: 2025-3-23 09:54 作者: Dysarthria 時間: 2025-3-23 16:37
https://doi.org/10.1007/978-3-663-02714-0termining ζ in the case of a tree, and it is shown that this tree algorithm can be generalized to yield ζ for any connected graph. Degree conditions are also derived which yield simple upper bounds for ζ.作者: 持久 時間: 2025-3-23 20:13
https://doi.org/10.1007/978-3-8349-8045-8always possible. In fact, Evans proved that any n × n partial latin square could be embedded in some t × t latin square for every t ≥ 2n..., the best possible result of this kind. Evans‘ paper is now generic. It has become the starting point for a fascinating collection of problems in the study of l作者: CUR 時間: 2025-3-24 00:03 作者: Ballad 時間: 2025-3-24 05:38
Musikkommunikation und ihre Wirkungen that certain graphs have an integral spectrum, i.e., every eigenvalue is an integer. Thus, it is natural to ask just which graphs have this property. We develop a systematic approach to this question based on operations on graphs. The general problem appears intractable.作者: 沒花的是打擾 時間: 2025-3-24 10:33
https://doi.org/10.1007/978-3-663-01491-1n independent set of vertices that contains at least 1/4 of the vertices of the graph. The purpose of this paper is to give an algorithm that produces an independent set in a planar graph that contains more than 2/9 of the vertices of the graph.作者: flex336 時間: 2025-3-24 11:04
https://doi.org/10.1007/978-3-322-96711-4 from this 2n-gon by adjunction of the chords (i,(i+m)′), i = 0, 1, 2, ..., n?1, the addition being taken modulo n. Restricting ourselves to the case when n is prime, we determine the isomorphism classes of the graphs G(n,m), and the corresponding automorphism groups. Various applications are discussed.作者: overhaul 時間: 2025-3-24 17:36 作者: 芳香一點 時間: 2025-3-24 22:00
Which graphs have integral spectra?, that certain graphs have an integral spectrum, i.e., every eigenvalue is an integer. Thus, it is natural to ask just which graphs have this property. We develop a systematic approach to this question based on operations on graphs. The general problem appears intractable.作者: 偽善 時間: 2025-3-25 00:44
Finding an independent set in a planar graph,n independent set of vertices that contains at least 1/4 of the vertices of the graph. The purpose of this paper is to give an algorithm that produces an independent set in a planar graph that contains more than 2/9 of the vertices of the graph.作者: aggressor 時間: 2025-3-25 03:24 作者: 腐蝕 時間: 2025-3-25 07:30 作者: clarify 時間: 2025-3-25 14:21 作者: incarcerate 時間: 2025-3-25 16:05 作者: 令人苦惱 時間: 2025-3-25 21:58 作者: 燈泡 時間: 2025-3-26 02:15 作者: 哀求 時間: 2025-3-26 07:13 作者: Project 時間: 2025-3-26 12:01 作者: 矛盾心理 時間: 2025-3-26 14:36 作者: 生命層 時間: 2025-3-26 18:42
Recent results on trees,Our object is to present six theorems on trees discovered since the appearance of the book [4]. These deal with (1) trees with hamiltonian square, (2) path numbers, (3) the tree graph of a graph, (4) the intersection graph of subtrees of a tree, (5) cospectral trees, and (6) the probability of an endpoint.作者: sorbitol 時間: 2025-3-27 01:01
Recent results on graphical enumeration,We present four of our counting results which are to appear soon in various journals. These comprise: (1) the number of caterpillars, (2) the number of self-complementary configurations, (3) the number of achiral trees, and (4) the probability of an endpoint in a large random tree. We conclude with a brief mention of four miscellaneous results.作者: STALL 時間: 2025-3-27 04:30 作者: jabber 時間: 2025-3-27 07:40
Chromatically equivalent graphs,Let G,H be graphs, and P(G,λ), P(H,λ) be the chromatic polynomials of G,H respectively. Then ., (written P .H), if P(G,λ) = P(H,λ)..In this paper, we first state some open questions relating to chromatic equivalence of graphs, and then give non-trivial examples of chromatically equivalent graphs and their chromatic polynomials.作者: 通便 時間: 2025-3-27 13:20 作者: Forsake 時間: 2025-3-27 13:36 作者: 吸氣 時間: 2025-3-27 18:10
On the ramsey number of the five-spoked wheel,Let r(W.) be the smallest n such that the five-spoked wheel W. √ G or else W. √ . for every graph G with n vertices. Recently, Erd?s asked whether whether r(W.) ≥ 18; we prove that 17 ≤ r(W.) ≤ 20. In so doing, we establish that r(C., W.) = 13. We conjecture that r(W.) = 20.作者: Canvas 時間: 2025-3-27 23:10
Graphs and Combinatorics978-3-540-37809-9Series ISSN 0075-8434 Series E-ISSN 1617-9692 作者: 按時間順序 時間: 2025-3-28 04:37 作者: febrile 時間: 2025-3-28 07:12 作者: ILEUM 時間: 2025-3-28 14:25 作者: 記憶法 時間: 2025-3-28 16:26 作者: 一美元 時間: 2025-3-28 21:25
https://doi.org/10.1007/978-3-663-10855-9crossing number are introduced and related to one another. We then deal with topological techniques in the theory of chromatic numbers, and state a very ambitious meta-conjecture which is quite useful in generating true theorems. In closing, we attempt to suggest appropriate directions for further r作者: strain 時間: 2025-3-29 00:04 作者: Phagocytes 時間: 2025-3-29 06:47
https://doi.org/10.1007/978-3-322-87301-9s, (2) we can determine the first p moments by counting closed walks and then find the spectrum from the moments, or (3) we can use certain subgraphs to determine the coefficients of the characteristic polynomial and then find its roots..In practice, however, all of these approaches may prove to be 作者: 無可非議 時間: 2025-3-29 11:04
https://doi.org/10.1007/978-3-663-01491-1n independent set of vertices that contains at least 1/4 of the vertices of the graph. The purpose of this paper is to give an algorithm that produces an independent set in a planar graph that contains more than 2/9 of the vertices of the graph.作者: 自作多情 時間: 2025-3-29 15:00
https://doi.org/10.1007/978-3-476-03772-5induce 1-factorizations of complete graphs. It is easy to show that these 1-factorizations possess enough symmetry to insure that if {F., F.} and {F., F.} are pairs of distinct 1-factors from such a 1-factorization, then the cycle structures of F. ∪ F. and F. ∪ F. are identical. The method is applie作者: frugal 時間: 2025-3-29 15:53
https://doi.org/10.1007/978-3-663-02714-0er well-known graphical invariants is discussed, and ζ is evaluated for a variety of special classes of graphs. A simple algorithm is developed for determining ζ in the case of a tree, and it is shown that this tree algorithm can be generalized to yield ζ for any connected graph. Degree conditions a作者: Bone-Scan 時間: 2025-3-29 22:57 作者: 少量 時間: 2025-3-30 01:24 作者: Barter 時間: 2025-3-30 05:11 作者: abstemious 時間: 2025-3-30 12:04
A survey of the reconstruction conjecture,rom a given deck of cards, each containing just one point-deleted subgraph of G, we proceed to derive information about G which is deducible from this deck..Various theorems proving the RC for trees are then taken up. The status of the RC for digraphs is reported. Several variations of the RC are st作者: 燈絲 時間: 2025-3-30 14:03
Which graphs have integral spectra?, that certain graphs have an integral spectrum, i.e., every eigenvalue is an integer. Thus, it is natural to ask just which graphs have this property. We develop a systematic approach to this question based on operations on graphs. The general problem appears intractable.作者: STING 時間: 2025-3-30 19:01
Generalized ramsey theory for graphs - a survey,This survey paper will emphasize the following class of problems: Given graphs G., ..., G., determine or estimate the Ramsey number r(G., ..., G.), the smallest number p such that if the lines of a complete graph K. are c-colored in any manner, then for some j there exists a subgraph in color j whic作者: homeostasis 時間: 2025-3-30 22:31 作者: 空中 時間: 2025-3-31 02:46
A survey of finite embedding theorems for partial latin squares and quasigroups,ow and column each of the integers 1,2,...,n occurs .. An example of a 4 × 4 partial latin square is given below..An immediate observation shows that the partial latin square P cannot be completed to a latin square; i.e., the empty cells cannot be filled in with numbers from the set {1,2,3,4} so tha作者: 討好女人 時間: 2025-3-31 06:26 作者: linear 時間: 2025-3-31 12:53 作者: 一夫一妻制 時間: 2025-3-31 13:53 作者: 寵愛 時間: 2025-3-31 21:06
On covering the points of a graph with point disjoint paths,er well-known graphical invariants is discussed, and ζ is evaluated for a variety of special classes of graphs. A simple algorithm is developed for determining ζ in the case of a tree, and it is shown that this tree algorithm can be generalized to yield ζ for any connected graph. Degree conditions a作者: 骯臟 時間: 2025-3-31 22:13
A useful family of bicubic graphs, from this 2n-gon by adjunction of the chords (i,(i+m)′), i = 0, 1, 2, ..., n?1, the addition being taken modulo n. Restricting ourselves to the case when n is prime, we determine the isomorphism classes of the graphs G(n,m), and the corresponding automorphism groups. Various applications are discus作者: Incommensurate 時間: 2025-4-1 05:37
Reconstructing combinatorial geometries,eometry generating functions of single element deletions. This result is applied to graphs to give the chromatic polynomial (for vertices or regions) and a number of other invariants which can be computed from the deck of edge deletions.作者: 最后一個 時間: 2025-4-1 06:31
Simulation Model to the Online Course Advisinge. Even the size of the student‘s group assigned to an advisor is defined by administrative policy but not necessarily by the needs of the training program, which one can be different according to the project‘s aim.作者: 不規(guī)則 時間: 2025-4-1 11:27
https://doi.org/10.1007/978-981-97-7391-6unterscheiden : Metalle sind in flüssigem und festem Zustand undurchsichtig, gl?nzend, gute Leiter von W?rme und Elektrizit?t. Die Elektrizit?t leiten sie zum Unterschied von den geschmolzenen oder gel?sten Elektrolyten ohne Zersetzung.
