[PDF] Top 20 On the Bruhat order of labeled graphs
Has 10000 "On the Bruhat order of labeled graphs" found on our website. Below are the top 20 most common "On the Bruhat order of labeled graphs".
On the Bruhat order of labeled graphs
... two Bruhat (partial) orders on graphs with vertices labeled 1, 2, ...matrices of such graphs). One is motivated by the classical Bruhat order on ... See full document
22
Using Interval Graphs in an Order Processing Optimization Problem
... research on the MOSP demonstrates that any instance of the problem can be put in a graph with a vertex for each client [9] and a solution can be obtained by traversing the arcs ... See full document
7
The Non-Specific Binding of Fluorescent-Labeled MiRNAs on Cell Surface by Hydrophobic Interaction.
... regulate the expression of target genes by complementarily binding to their 3 'untranslated region (3'UTR) ...and the patho- genesis of various diseases including cancer, cardiovascular and ... See full document
17
On the treewidths of graphs of bounded degree.
... based on a tree decomposition of treewidth k for G ...ond Order (MSO) logic can be solved in polynomial time when a tree decomposition of bound- ed treewidth is available for the ... See full document
9
Upper bounds on the Laplacian spread of graphs
... and the minimal Laplacian spread among all trees of order ...Recently the unicyclic graphs with maximum and minimum value of the Laplacian spread were studied in [5, 16] ... See full document
15
On the Adjacent Eccentric Distance Sum Index of Graphs.
... information of molecules, including physico-chemical, toxicologic, pharma- cologic, biological and other properties of chemical ...based on a simple graph, which is an ...zeroth order Randic ... See full document
12
The (mis)use of graphs
... picture of the company’s “financial health” or Corporate Social ...when the choice of the variables to be displayed on graphs depends on the company’s ... See full document
57
Distance matrices on the H-join of graphs: A general result and applications
... graph of order n, that is, on n vertices, with vertex set V ( G ) and edge set E ( G ) .... The cardinality of V ( G ) is called the order of ...is the set ... See full document
21
Communities and Anomaly Detection in Large Edged-Labeled Graphs
... part of the natural structure of many different networks and analyzed their shape and ...as the interaction between users and products and between ...all the same and we are able to ... See full document
194
Concept Location based on System Dependency Graphs
... before, the System Dependency Graph is an important and useful tool due to its graphi- cal ...representation. The tool built as described in the last section only offers methods to access the ... See full document
72
On the total domatic number of regular graphs
... S of vertices of a graph G = (V, E) without isolated vertex is a total dominating set if every vertex of V (G) is adjacent to some vertex in ...S. The total domatic number of a graph G ... See full document
7
A Partial Order on Bipartite Graphs with n Vertices
... Möbius inversion for categories was considered for the first time by Leroux [Ler75]. A Möbius category in the sense of Leroux is a decomposition finite category C (i.e. a small category where each ... See full document
10
Extremal matrices for the Bruhat-graph order
... consider the class A 0 sym (n, k) of symmetric (0, 1)-matrices with zero trace and constant row sums k which can be identified with the class of the adjacency matrices of ... See full document
21
Minimal matrices in the Bruhat order for symmetric (0,1)-matrices
... two of its faces are m-gons and all other faces are pentagons and/or ...count the outer (unbounded) face of G.) In the rest of the paper we only consider m ≥ 3; note that for m = ... See full document
155
Statistical inference on random graphs and networks
... about the expected time to ...upper-bound the expectation of the waiting time, but we show that CFTP compares favorably with standard MCMC forward simulation: the waiting time is (up to ... See full document
97
A note on arbitrarily vertex decomposable graphs
... Observe that any necessary condition for a graph to contain a perfect matching (or a matching that omits exactly one vertex) is a necessary condition for a graph to be arbitrarily vertex decomposable. Thus we will assume ... See full document
10
Comparison of the efficacy of biodegradable and non-biodegradable scintillation liquids on the counting of tritium- and [14C]-labeled compounds
... Unit of UNIFESP/Sociedade Paulista para o Desen- volvimento da Medicina/Hospital São Paulo (UNIFESP/SPDM/HSP) recommends stan- dardized procedures that fulfill current legis- lation and minimize safety problems in ... See full document
7
Effect of Antimalarial Drugs on the Bioavailability of the Methylenediphosphonic Acid Labeled with Technetium99m (99mTc-MDP) in Wistar Rats
... stages of the malaria parasite. For this, it interacts with heme of hemoglobin in RBCs to produce carbon-centered free radicals that alkylate protein and damage the microorganelles and ... See full document
8
On the multiplicity of α as an eigenvalue of Aα(G) of graphs with pendant vertices
... where the matrices N − and N + are obtained from the Lapla- cian matrix and signless Laplacian matrix, respectively, taking the entries corresponding to the internal vertices which are ... See full document
23
On the monoids of transformations that preserve the order and a uniform partition
... anti-homomorphism of semigroups and let ϕ : S −→ T (T ) be a homomorphism of ...action of T on S and that ϕ is a right action of S on T if they verify the following ... See full document
18
temas relacionados