Results 71 to 80 of about 153,964 (249)
Journal of Combinatorial Designs, EarlyView.ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$ in PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$. We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$ with T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$.
Sebastian Petit, Geertrui Van de Voorde
wiley +1 more source
On Orthogonal Double Covers and Decompositions of Complete Bipartite Graphs by Caterpillar Graphs
Algorithms, 2023 Nowadays, graph theory is one of the most exciting fields of mathematics due to the tremendous developments in modern technology, where it is used in many important applications.
Ahmed El-Mesady +3 more
doaj +1 more source
Local colourings and monochromatic partitions in complete bipartite graphs
, 2016 We show that for any $2$-local colouring of the edges of the balanced complete bipartite graph $K_{n,n}$, its vertices can be covered with at most~$3$ disjoint monochromatic paths.
Lang, Richard, Stein, Maya
core +1 more source
Multidecompositions of the Balanced Complete Bipartite Graph into Paths and Stars
, 2013 Let and denote a path and a star with edges, respectively. For graphs , , and , a -multidecomposition of is a partition of the edge set of into copies of and copies of with at least one copy of and at least one copy of .
Hung-Chih Lee, Yen-Po Chu
semanticscholar +1 more source
Transforming Solutions for the Oberwolfach Problem into Solutions for the Spouse‐Loving Variant
Journal of Combinatorial Designs, EarlyView.ABSTRACT The Oberwolfach problem OP ( F ) $\mathrm{OP}(F)$, for a 2‐factor F $F$ of K n ${K}_{n}$, asks whether there exists a 2‐factorization of K n ${K}_{n}$ (if n $n$ is odd) or K n − I ${K}_{n}-I$ (if n $n$ is even) where each 2‐factor is isomorphic to F $F$. Here, I $I$ denotes any 1‐factor of K n ${K}_{n}$. For even n $n$, the problem OP( F ) $(F)
Maruša Lekše, Mateja Šajna
wiley +1 more source
Algoritma matching bobot maskimum dalam graph bipartit komplit berboto [PDF]
, 1998 ABSTRAK Suatu matching dalam graph G adalah subgraph 1-regular pada G yang disebabkan oleh kumpulan dart pasangan garis yang tidak adjacent. Suatu matching merupakan matching maksimum bila matching tersebut mempunyai harga pokok maksimum. Matching dalam
Astuti , Yani Parti
core
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
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
The n-Hosoya Polynomials of the Composite of Some Special Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2013 It is not easy to find the n-Hosoya polynomial of the compound graphs constructed in the form G1⊠G2 for any two disjoint connected graphs and .Therefore, in this paper, we obtain n-Hosoya polynomial of G1⊠G2 when is a complete graph and is a special ...
Ahmed Ali
doaj +1 more source