Results 21 to 30 of about 197 (101)
On the n-Partite Tournaments with Exactly n − m + 1 Cycles of Length m
Discussiones Mathematicae Graph Theory, 2021 Gutin and Rafiey [Multipartite tournaments with small number of cycles, Australas J. Combin. 34 (2006) 17–21] raised the following two problems: (1) Let m ∈ {3, 4, . . ., n}.
Guo Qiaoping, Meng Wei
doaj +1 more source
On the Skew Spectra of Cartesian Products of Graphs
Electronic Journal of Combinatorics, 2013 An oriented graph G is a simple undirected graph G with an orientation σ, which assigns to each edge of G a direction so that G becomes a directed graph.
Denglan Cui, Yaoping Hou
semanticscholar +1 more source
Outpaths of Arcs in Regular 3-Partite Tournaments
Discussiones Mathematicae Graph Theory, 2021 Guo [Outpaths in semicomplete multipartite digraphs, Discrete Appl. Math. 95 (1999) 273–277] proposed the concept of the outpath in digraphs. An outpath of a vertex x (an arc xy, respectively) in a digraph is a directed path starting at x (an arc xy ...
Guo Qiaoping, Meng Wei
doaj +1 more source
Veterinary Dermatology, Volume 27, Issue 5, Page 391-e98, October 2016., 2016 Background– Pseudomonas aeruginosa (PA) may cause suppurative otitis externa with severe inflammation and ulceration in dogs. Multidrug resistance is commonly reported for this organism, creating a difficult therapeutic challenge. Objective– The aim of this study was to evaluate the in vitro antimicrobial activity of a gel containing 0.5 µg/mL of ...
Giovanni Ghibaudo +6 more
wiley +1 more source
Classification of Filiform Lie Algebras up to dimension 7 Over Finite Fields
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 This paper tries to develop a recent research which consists in using Discrete Mathematics as a tool in the study of the problem of the classification of Lie algebras in general, dealing in this case with filiform Lie algebras up to dimension 7 over ...
Falcón Óscar J. +4 more
doaj +1 more source
Conditional resolvability in graphs: a survey
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 38, Page 1997-2017, 2004., 2004 For an ordered set W = {w1, w2, …, wk} of vertices and a vertex v in a connected graph G, the code of v with respect to W is the k‐vector cW(v) = (d(v, w1), d(v, w2), …, d(v, wk)), where d(x, y) represents the distance between the vertices x and y. The set W is a resolving set for G if distinct vertices of G have distinct codes with respect to W.
Varaporn Saenpholphat, Ping Zhang
wiley +1 more source
Discrete Mathematics & Theoretical Computer Science, 2023 Mixed graphs have both directed and undirected edges. A mixed cage is a regular mixed graph of given girth with minimum possible order. In this paper mixed cages are studied. Upper bounds are obtained by general construction methods and computer searches.
Geoffrey Exoo
doaj +1 more source
The hull number of an oriented graph
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 36, Page 2265-2275, 2003., 2003 We present characterizations of connected graphs G of order n ≥ 2 for which h+(G) = n. It is shown that for every two integers n and m with 11≤n−≤m≤(n2), there exists a connected graph G of order n and size m such that for each integer k with 2 ≤ k ≤ n, there exists an orientation of G with hull number G.
Gary Chartrand +2 more
wiley +1 more source
An algebraic framework of weighted directed graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 58, Page 3657-3678, 2003., 2003 We show that an algebraic formulation of weighted directed graphs leads to introducing a k‐vector space equipped with two coproducts Δ and Δ˜ verifying the so‐called coassociativity breaking equation (Δ˜⊗id)Δ=(id⊗Δ)Δ˜. Such a space is called an L‐coalgebra.
Philippe Leroux
wiley +1 more source
The Dichromatic Number of Infinite Families of Circulant Tournaments
Discussiones Mathematicae Graph Theory, 2017 The dichromatic number dc(D) of a digraph D is defined to be the minimum number of colors such that the vertices of D can be colored in such a way that every chromatic class induces an acyclic subdigraph in D.
Javier Nahid, Llano Bernardo
doaj +1 more source