標(biāo)題: Titlebook: Combinatorics, Graph Theory and Computing; SEICCGTC 2021, Boca Frederick Hoffman,Sarah Holliday,John Wierman Conference proceedings 2024 T [打印本頁(yè)] 作者: Autonomous 時(shí)間: 2025-3-21 19:21
書目名稱Combinatorics, Graph Theory and Computing影響因子(影響力)
書目名稱Combinatorics, Graph Theory and Computing影響因子(影響力)學(xué)科排名
書目名稱Combinatorics, Graph Theory and Computing網(wǎng)絡(luò)公開(kāi)度
書目名稱Combinatorics, Graph Theory and Computing網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書目名稱Combinatorics, Graph Theory and Computing被引頻次
書目名稱Combinatorics, Graph Theory and Computing被引頻次學(xué)科排名
書目名稱Combinatorics, Graph Theory and Computing年度引用
書目名稱Combinatorics, Graph Theory and Computing年度引用學(xué)科排名
書目名稱Combinatorics, Graph Theory and Computing讀者反饋
書目名稱Combinatorics, Graph Theory and Computing讀者反饋學(xué)科排名
作者: abolish 時(shí)間: 2025-3-21 23:50 作者: admission 時(shí)間: 2025-3-22 01:49 作者: Frequency-Range 時(shí)間: 2025-3-22 05:12
,Mixed-Level Covering, Locating, and?Detecting Arrays via Cyclotomy,, for certain . sufficiently large with respect to ., such a cyclotomic array is always a covering array of strength .. Asymptotically such arrays have far too many rows to be competitive with certain other covering array constructions. Nevertheless, for small values of ., this cyclotomic method pro作者: 背帶 時(shí)間: 2025-3-22 09:50 作者: Grandstand 時(shí)間: 2025-3-22 15:41 作者: Grandstand 時(shí)間: 2025-3-22 20:10 作者: Palpitation 時(shí)間: 2025-3-22 22:12
,On a?Convex Geometric Connection to?Threshold Logic,th 2 or 3 maximal faces from the class of all cubical complexes. This recognition of cut-complexes is closely related to an old proposal on cubical lattices by N. Metropolis and G. C. Rota. They proposed cubical lattices may also be used for synthesis of Boolean functions parallel to the conventiona作者: NOTCH 時(shí)間: 2025-3-23 02:20 作者: LAITY 時(shí)間: 2025-3-23 07:12 作者: 非秘密 時(shí)間: 2025-3-23 10:59 作者: 鋼筆尖 時(shí)間: 2025-3-23 15:59 作者: opinionated 時(shí)間: 2025-3-23 19:15
,Graph Constructions Derived from?Interconnection Networks,er. For Dragonfly networks, the building block network is a complete graph and the wiring together is done by either a cycle or a complete graph. The process may be viewed as a way to construct a new graph from two component graphs.The resulting graph is known as a replacement graph. Furthermore, on作者: Admonish 時(shí)間: 2025-3-23 22:58
,On the?Target Pebbling Conjecture,ansit. The pebbling number of a demand in a graph is the smallest number for which every placement of that many supply pebbles satisfies the demand. The Target Conjecture (Herscovici-Hester-Hurlbert, 2009) posits that the largest pebbling number of a demand of fixed size . occurs when the demand is 作者: Fibrinogen 時(shí)間: 2025-3-24 05:51 作者: DECRY 時(shí)間: 2025-3-24 07:41
,On the?Locating Rainbow Connection Number of?the?Comb Product with?Complete Graphs or?Trees, and define the locating rainbow connection number within this framework. Our main results establish tight upper and lower bounds for . in the context of comb products. Additionally, we determine the locating rainbow connection number for the comb product of an arbitrary graph with a complete graph 作者: sigmoid-colon 時(shí)間: 2025-3-24 14:26 作者: Urgency 時(shí)間: 2025-3-24 18:28
,The ,-splitting Operation for?Matroids Representable Over?Prime Fields ,(,),onnectivity of the .-matoids. A Sufficient condition to obtain a 3-connected .-matroid from a 3-connected .-matroid using the .-splitting operation is also provided. In the last section, we obtain a sufficient condition to produce an Eulerian .-matroid from an Eulerian .-matroid using .-splitting operation.作者: hedonic 時(shí)間: 2025-3-24 19:45
Differences of Functions with the Same Value Multiset,ger version of Hall’s theorem, which gives a description of . and . in terms of .. We conclude by presenting further directions and questions that relate this new approach to applications of Hall’s theorem.作者: CAMEO 時(shí)間: 2025-3-24 23:50
,Nonexistence of?a?Subfamily of?a?Family of?Edge-Regular Graphs,tions, where . is the number of vertices and .. We consider the case where ., with the added condition that the common neighbor set of every pair of adjacent vertices induces ., a disjoint union of edges.作者: BACLE 時(shí)間: 2025-3-25 06:05
,On a?Convex Geometric Connection to?Threshold Logic,l Boolean algebraic methods. The characterization will be applied to recognize several cut-complexes in the 4-dimensional cube. The cut-complexes of the 4-cube are used to define a new poset that happens to be a distributive lattice.作者: 帶子 時(shí)間: 2025-3-25 10:24 作者: abstemious 時(shí)間: 2025-3-25 12:41
The Existence Problem for Strong Complete Mappings of Finite Groups, work done on the existence problem for strong complete mappings of finite groups. We will also establish new classes of strongly admissible 2-groups. We will also give theoretical proofs of the strong admissibility of some groups of order 16, whose strong admissibility has only been proved via computer searches.作者: 歹徒 時(shí)間: 2025-3-25 16:25 作者: 隱藏 時(shí)間: 2025-3-25 23:17 作者: 受辱 時(shí)間: 2025-3-26 03:53
https://doi.org/10.1007/978-3-030-49012-6ger version of Hall’s theorem, which gives a description of . and . in terms of .. We conclude by presenting further directions and questions that relate this new approach to applications of Hall’s theorem.作者: 中國(guó)紀(jì)念碑 時(shí)間: 2025-3-26 05:07
7 Disease Management of , Infectionstions, where . is the number of vertices and .. We consider the case where ., with the added condition that the common neighbor set of every pair of adjacent vertices induces ., a disjoint union of edges.作者: floodgate 時(shí)間: 2025-3-26 11:54 作者: Project 時(shí)間: 2025-3-26 12:44 作者: 使困惑 時(shí)間: 2025-3-26 18:10
Conference proceedings 2024and Computing (SEICCGTC 2021), virtually held at Florida Atlantic University in Boca Raton, USA, on March 8-12, 2021. As has been a tradition since its inception in 1970, this edition once more brought together mathematicians, practitioners, and scientists around novel findings in combinatorics, gra作者: Irritate 時(shí)間: 2025-3-27 00:02 作者: 芳香一點(diǎn) 時(shí)間: 2025-3-27 05:07
Disease Management of , Infectionsallow us to obtain some new properties of violator operators and co-violator operators, emphasizing their interconnections. In particular, we show that uniquely generated violator spaces satisfy so-called Krein-Milman properties, i.e., . and . for every ..作者: Delirium 時(shí)間: 2025-3-27 05:46 作者: 頂點(diǎn) 時(shí)間: 2025-3-27 10:33 作者: myopia 時(shí)間: 2025-3-27 14:36
,Cospanning Characterizations of?Violator and?Co-violator Spaces,allow us to obtain some new properties of violator operators and co-violator operators, emphasizing their interconnections. In particular, we show that uniquely generated violator spaces satisfy so-called Krein-Milman properties, i.e., . and . for every ..作者: CRANK 時(shí)間: 2025-3-27 19:26 作者: febrile 時(shí)間: 2025-3-28 00:08 作者: Anal-Canal 時(shí)間: 2025-3-28 04:11 作者: 不溶解 時(shí)間: 2025-3-28 06:17 作者: finale 時(shí)間: 2025-3-28 11:26 作者: maculated 時(shí)間: 2025-3-28 15:38
Biological Control of Fungal Plant Pathogensviewpoint of . cordiality. We show both conjectures to be false, discuss the (2,?3)-cordiality of orientations of the Petersen graph, and establish an upper bound for the number of edges a graph can have and still be (2,?3)-orientable.作者: infinite 時(shí)間: 2025-3-28 21:52 作者: ADAGE 時(shí)間: 2025-3-29 02:48
978-3-031-52971-9The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl作者: Dri727 時(shí)間: 2025-3-29 06:42
Frederick Hoffman,Sarah Holliday,John WiermanBridges novel findings from academia to real-world challenges in business, industry, and government.Showcases true cross-seeding between the fields of combinatorics, graph theory, and computing.Brings作者: 意外 時(shí)間: 2025-3-29 07:54
Springer Proceedings in Mathematics & Statisticshttp://image.papertrans.cn/d/image/242209.jpg作者: colloquial 時(shí)間: 2025-3-29 13:25
7 Disease Management of , InfectionsWe construct new strongly regular graphs with parameters (85,?20,?3,?5) and (4369,?272,?15,?17). These parameters are the same as those arising from the generalized quadrangle . for ..作者: 溫和女人 時(shí)間: 2025-3-29 16:16
Biological Control of Fungal Plant PathogensThe .-ary .-dimensional hypercube is a generalization of the hypercube when .. In this paper, we study the structural properties of .-ary .-dimensional hypercube by considering the structure of the resulting graph when up?to approximately . vertices are deleted from it.作者: 某人 時(shí)間: 2025-3-29 21:39 作者: 散步 時(shí)間: 2025-3-30 03:08 作者: cloture 時(shí)間: 2025-3-30 06:56 作者: Ingratiate 時(shí)間: 2025-3-30 09:07
Decomposition of the Johnson Graphs into Graph-Pairs of Order 4, the .-element subsets of a .-element set, and two vertices are adjacent if the intersection of the corresponding subsets contains . elements. We show necessary and sufficient conditions for .(.,?2) to admit a decomposition into graph-pairs of order 4.作者: 多山 時(shí)間: 2025-3-30 13:53
,Multicore Graphs: Characterization and?Properties,pp. 517:30–52 (2017)) [.]. We prove that the multicore graphs are the .-free chordal graphs and we present a characterization of the class which provides a simple linear time recognition algorithm. We also show its interrelation with other subclasses of chordal graphs: the clique-corona graphs and the starlike graphs.作者: apropos 時(shí)間: 2025-3-30 17:13
(2, 3)-Cordial Oriented Hypercubes, a (2,?3)-cordial oriented hypercube for any dimension divisible by 3. Next, we provide examples of (2,?3)-cordial oriented hypercubes of dimension not divisible by 3 and state a conjecture on existence for dimension .. We close by presenting the only 3D oriented hypercubes up?to isomorphism that are not (2,?3)-cordial.作者: Pepsin 時(shí)間: 2025-3-30 21:11
,On the?Locating Rainbow Connection Number of?the?Comb Product with?Complete Graphs or?Trees, and define the locating rainbow connection number within this framework. Our main results establish tight upper and lower bounds for . in the context of comb products. Additionally, we determine the locating rainbow connection number for the comb product of an arbitrary graph with a complete graph or a tree.作者: BLANC 時(shí)間: 2025-3-31 01:00
,Cycle-Compelling Colorings of?Graphs,tains a cycle. The cycle-compelling number is defined to be the minimum . such that some .-coloring is cycle-compelling. We provide some general bounds and algorithmic results on this and related parameters. We also investigate the value in specific graph families including cubic graphs, disjoint union of cliques, and outerplanar graphs.作者: 侵害 時(shí)間: 2025-3-31 08:38 作者: PACK 時(shí)間: 2025-3-31 10:01 作者: Small-Intestine 時(shí)間: 2025-3-31 16:04 作者: 阻塞 時(shí)間: 2025-3-31 19:37 作者: Anticlimax 時(shí)間: 2025-3-31 23:52
Jan Dijksterhuis,Robert A. Samson a (2,?3)-cordial oriented hypercube for any dimension divisible by 3. Next, we provide examples of (2,?3)-cordial oriented hypercubes of dimension not divisible by 3 and state a conjecture on existence for dimension .. We close by presenting the only 3D oriented hypercubes up?to isomorphism that are not (2,?3)-cordial.作者: 確定無(wú)疑 時(shí)間: 2025-4-1 03:59
Private Research and Public Goods: , and define the locating rainbow connection number within this framework. Our main results establish tight upper and lower bounds for . in the context of comb products. Additionally, we determine the locating rainbow connection number for the comb product of an arbitrary graph with a complete graph or a tree.作者: 刺穿 時(shí)間: 2025-4-1 07:04
Molecular Tools for Plant Breedingtains a cycle. The cycle-compelling number is defined to be the minimum . such that some .-coloring is cycle-compelling. We provide some general bounds and algorithmic results on this and related parameters. We also investigate the value in specific graph families including cubic graphs, disjoint union of cliques, and outerplanar graphs.作者: 背心 時(shí)間: 2025-4-1 13:44
Jo?lle Salomon Cavin,Nelly Niwa the .-splitting operation to the matroids representable over the field .(.),? called the .-matoids. We characterize circuits, and bases of the resulting matroid in terms of the circuits, and the bases of the original matroid, respectively. It is proved that the .-splitting operation preserves the c作者: 即席演說(shuō) 時(shí)間: 2025-4-1 17:39
Jo?lle Salomon Cavin,Nelly Niwa if and only if . admits strong complete mappings. A natural question to ask is, which finite groups admit strong complete mappings? We will summarize work done on the existence problem for strong complete mappings of finite groups. We will also establish new classes of strongly admissible 2-groups.作者: neolith 時(shí)間: 2025-4-1 20:06
https://doi.org/10.1007/978-3-030-49012-6 .,?. from . to itself. In this work we relax the condition that . and . are bijections and instead study functions that can be expressed as the difference of two functions with the .. We construct all possible functions .,?. with same value multiset, such that .. As a consequence, we obtain a stron作者: 子女 時(shí)間: 2025-4-2 01:25 作者: 構(gòu)成 時(shí)間: 2025-4-2 04:27 作者: 刺穿 時(shí)間: 2025-4-2 07:29
