Results 71 to 80 of about 143,400 (232)
International Journal of Applied Mathematics and Computer ScienceThis paper introduces the concept of filters in a rough bi-Heyting algebra. The rough bi-Heyting algebra defined through the rough semiring offers interesting properties.
Praba Bashyam +1 more
doaj +1 more source
P3-Factorization of complete bipartite graphs
Discrete Mathematics, 1988 Let \(P_ 3\) be a path of 3 points and \(K_{m,n}\) be a complete bipartite graph with partite sets \(V_ 1\) and \(V_ 2\), where \(| V_ 1| =m\) and \(| V_ 2| =n.\) A spanning subgraph F of \(K_{m,n}\) is called a \(P_ 3\)-factor if each component of F is isomorphic to \(P_ 3\). If \(K_{m,n}\) is expressed as a line-disjoint sum of \(P_ 3\)-factors, then
openaire +2 more sources
Disjoint Total Dominating Sets in Planar Graphs
Journal of Graph Theory, EarlyView.ABSTRACT The vertex set of any planar graph of minimum degree at least 3 can be colored in two colors so that every vertex has a neighbor of each color. If the graph is a planar triangulation, the coloring can be chosen such that every vertex has a neighbor of its own color and at least two neighbors of the opposite color.
Eva Rotenberg +2 more
wiley +1 more source
Shortest paths in orthogonal graphs [PDF]
, 1991 Orthogonal graphs were introduced as a simple but powerful tool for the description and analysis of a class of interconnection networks. Routing, and hence finding shortest paths between any two nodes of an orthogonal graph, becomes an important problem.
Bhatia, Sandeep +2 more
core
Matching graphs of Hypercubes and Complete Bipartite Graphs [PDF]
Electronic Notes in Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Tight Bounds for Hypercube Minor‐Universality
Journal of Graph Theory, EarlyView.ABSTRACT A graph G $G$ is m $m$‐minor‐universal if every graph H $H$ with at most m $m$ edges and no isolated vertices is contained as a minor in G $G$. Recently, Benjamini, Kalifa and Tzalik proved that there is an absolute constant c>0 $c\gt 0$ such that the d $d$‐dimensional hypercube Qd ${Q}_{d}$ is (c⋅2d/d $c\cdot {2}^{d}/d$)‐minor‐universal ...
Emma Hogan +5 more
wiley +1 more source
On the local distinguishing chromatic number
AKCE International Journal of Graphs and Combinatorics, 2019 The distinguishing number of graphs is generalized in two directions by Cheng and Cowen (local distinguishing number) and Collins and Trenk (Distinguishing chromatic number). In this paper, we define and study the local distinguishing chromatic number of
Omid Khormali
doaj +2 more sources
Some results on triangle partitions [PDF]
, 2011 We show that there exist efficient algorithms for the triangle packing problem in colored permutation graphs, complete multipartite graphs, distance-hereditary graphs, k-modular permutation graphs and complements of k-partite graphs (when k is fixed). We
Kloks, Ton, Poon, Sheung-Hung
core
Topological Symmetry Groups of Complete Bipartite Graphs [PDF]
, 2014 The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular abstract ...
Kathleen Hake, B. Mellor, Matt Pittluck
semanticscholar +1 more source
Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number
Journal of Graph Theory, EarlyView.ABSTRACT We continue the study of ( tw , ω ) $({\mathsf{tw}},\omega )$‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by ...
Claire Hilaire +2 more
wiley +1 more source