Results 31 to 40 of about 292,611 (264)
Requiring that Minimal Separators Induce Complete Multipartite Subgraphs
Discussiones Mathematicae Graph Theory, 2018 Complete multipartite graphs range from complete graphs (with every partite set a singleton) to edgeless graphs (with a unique partite set). Requiring minimal separators to all induce one or the other of these extremes characterizes, respectively, the ...
McKee Terry A.
doaj +1 more source
Kaleidoscopic Edge-Coloring of Complete Graphs and r-Regular Graphs
Discussiones Mathematicae Graph Theory, 2019 For an r-regular graph G, we define an edge-coloring c with colors from {1, 2, . . . , k}, in such a way that any vertex of G is incident with at least one edge of each color. The multiset-color cm(v) of a vertex v is defined as the ordered tuple (a1, a2,
Li Xueliang, Zhu Xiaoyu
doaj +1 more source
AKCE International Journal of Graphs and Combinatorics, 2021 We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers.
Kalpana Mahalingam +1 more
doaj +1 more source
The Square of Some Generalized Hamming Graphs
Mathematics, 2023 In this paper, we study the square of generalized Hamming graphs by the properties of abelian groups, and characterize some isomorphisms between the square of generalized Hamming graphs and the non-complete extended p-sum of complete graphs.
Yipeng Li, Jing Zhang, Meili Wang
doaj +1 more source
The local vertex anti-magic coloring for certain graph operations
HeliyonThis work proves the local vertex anti-magic coloring of even regular circulant bipartite graphs C(m;L). Let G be either Kr,r or Kr,r−F, F is a 1-factor.
L. Uma, G. Rajasekaran
doaj +1 more source
Generalized Fractional Total Colorings of Complete Graph
Discussiones Mathematicae Graph Theory, 2013 An additive and hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let P and Q be two additive and hereditary graph properties and let r, s be integers such that r ≥ s Then an fractional (P,
Karafová Gabriela
doaj +1 more source
The n-Hosoya Polynomials of Some Classes of Thorn Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2010 The n-Hosoya Polynomials of cog-complete graphs , thorn cog-complete graphs , cog-stars , thorn cog-stars , cog-wheels , and thorn cog-wheels are obtained . The n-Wiener indices of these graphs are also determined .
Ali Ali, Ahmed Ali
doaj +1 more source
Decomposing the complete r-graph
Journal of Combinatorial Theory, Series A, 2018 Let $f_r(n)$ be the minimum number of complete $r$-partite $r$-graphs needed to partition the edge set of the complete $r$-uniform hypergraph on $n$ vertices. Graham and Pollak showed that $f_2(n) = n-1$. An easy construction shows that $f_r(n)\le (1-o(1))\binom{n}{\lfloor r/2\rfloor}$ and it has been unknown if this upper bound is asymptotically sharp.
Imre Leader +2 more
openaire +4 more sources
Dual Protection Routing Trees on Graphs
Mathematics, 2023 In IP networks, packet forwarding is destination-based and hop-by-hop, and routes are built as needed. Kwong et al. introduced a protection routing in which packet delivery to the destination node can proceed uninterrupted in the event of any single node
Kung-Jui Pai
doaj +1 more source
Decompositions of Complete Multipartite Graphs into Complete Graphs
, 2011 Let $k\geq\ell\geq1$ and $n\geq 1$ be integers. Let $G(k,n)$ be the complete $k$-partite graph with $n$ vertices in each colour class. An $\ell$-decomposition of $G(k,n)$ is a set $X$ of copies of $K_k$ in $G(k,n)$ such that each copy of $K_\ell$ in $G(k,n)$ is a subgraph of exactly one copy of $K_k$ in $X$. This paper asks: when does $G(k,n)$ have an $
Fabila-Monroy, Ruy, Wood, David R.
openaire +2 more sources