نتایج جستجو برای: bicyclic digraph

تعداد نتایج: 4605  

Journal: :Transactions of the American Mathematical Society 1985

Journal: :Taiwanese Journal of Mathematics 1999

Journal: :Ars Mathematica Contemporanea 2016

Journal: :Journal of Combinatorial Optimization 2018

Journal: :Earthline Journal of Mathematical Sciences 2022

This work introduces a novel topological constraint called the intopological digraph space imposed by subbasis ... contains one vertice such that edge ẹ is indegree of it and investigates some properties this structure. Our objective to provide crucial first step in study characteristics digraphs utilizing appropriate topology.

2014
Manuel Ceballos Juan Núñez Ángel F. Tenorio

In this work, we design an algorithmic method to associate combinatorial structures with finite-dimensional Malcev algebras. In addition to its theoretical study, we have performed the implementation of procedures to construct the digraph associated with a given Malcev algebra (if its associated combinatorial structure is a digraph) and, conversely, a second procedure to test if a given digraph...

Journal: :Theor. Comput. Sci. 2003
Maggie Xiaoyan Cheng Xiufeng Du Manki Min Hung Q. Ngo Lu Ruan Jianhua Sun Weili Wu

Many interconnection networks can be constructed with line digraph iterations. A digraph has super link-connectivity d if it has link-connectivity d and every link-cut of cardinality d consists of either all out-links coming from a node, or all in-links ending at a node, excluding loop. In this paper, we show that the link-digraph iteration preserves super link-connectivity. c © 2003 Elsevier B...

2007
Hortensia Galeana-Sánchez

For any digraph D we construct a digraph s(S) such that D has a k-kernel iff s(S) has a k-kernel. The method employed allows to prove that, any digraph is an induced subdigraph of an infinite set of digraphs with (resp. without) k-kernel; and it can be used as a powerful tool in the construction of a large class of digraphs with (resp. without) k-kernel. Previous results are generalyzed. Mathem...

2005
Raymond Bisdorff

In this communication, we introduce an original algorithm for computing both dominant and absorbent kernels in a bipolar ordinal valued digraph. The approach relies on theoretical results recently obtained by Bisdorff, Pirlot and Roubens [8] which give a constructive – fixpoint equation based – proof of the bijection between bipolar ordinal valued kernels of such a valued digraph and the crisp ...

2014
Xiao-Na Wang Elizabeth H. Krenske Ryne C. Johnston K. N. Houk Richard P. Hsung

Electrocyclic ring opening of 4,6-fused cyclobutenamides 1 under thermal conditions leads to cis,trans-cyclooctadienones 2-E,E as transient intermediates, en route to 5,5-bicyclic products 3. Theoretical calculations predict that 4,5-fused cyclobutenamides should likewise undergo thermal ring opening, giving cis,trans-cycloheptadienones, but in this case conversion to 5,4-bicyclic products is t...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید