Results 31 to 40 of about 1,157,203 (300)
A C3 Magic Decomposition on Friendship Graph with Odd Order
Jurnal Ilmu Dasar, 2022 Let G = (V,E) is graph with a non-empty set V containing vertices and a set of edges E. Also note that if H = {H_i⊆G_i = 1,2,3,...,n} is a collection of subgraphs from G with H_i≅Hj,i ≠ j.
Indah Chairun Nisa +2 more
doaj +1 more source
Fast Spectral Approximation of Structured Graphs with Applications to Graph Filtering
Algorithms, 2020 To analyze and synthesize signals on networks or graphs, Fourier theory has been extended to irregular domains, leading to a so-called graph Fourier transform.
Mario Coutino +3 more
doaj +1 more source
Toeplitz graph decomposition [PDF]
Transactions on Combinatorics, 2012 Let $n,t_1,...,t_k$ be distinct positive integers. A Toeplitz graph $G=(V, E)$ denoted by $T_n$ is a graph, where $V ={1,...,n}$ and $E= {(i,j) : |i-j| in {t_1,...,t_k}}$.In this paper, we present some results on decomposition of Toeplitz graphs.
Samira Hossein Ghorban
doaj
ON P4-DECOMPOSITION OF GRAPHS [PDF]
Taiwanese Journal of Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Genus Distribution for a Graph [PDF]
, 2009 In this paper we develop the technique of a distribution decomposition for a graph. A formula is given to determine genus distribution of a cubic graph.
Liangxia, Wan +2 more
core +1 more source
The Balanced Decomposition Number of TK4 and Series-Parallel Graphs
Discussiones Mathematicae Graph Theory, 2013 A balanced colouring of a graph G is a colouring of some of the vertices of G with two colours, say red and blue, such that there is the same number of vertices in each colour. The balanced decomposition number f(G) of G is the minimum integer s with the
Fujita Shinya, Liu Henry
doaj +1 more source
Decomposition of hypercube graphs into paths and cycles of length four
AKCE International Journal of Graphs and Combinatorics, 2022 By a [Formula: see text]-decomposition of a graph G, we mean a partition of the edge set of G into p paths of length 4 and q cycles of length 4. In this paper, we give conditions for a [Formula: see text]-decomposition of the n-dimensional hypercube ...
D. Saranya, S. Jeevadoss
doaj +1 more source
Independent sets of maximum weight in apple-free graphs [PDF]
, 2010 We present the first polynomial-time algorithm to solve the maximum weight independent set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs,
Lozin, Vadim V. +2 more
core +1 more source
Graph Regularized Tensor Decomposition for Recommender Systems
, 2022 Humans make decisions when presented with choices based on influences. The Internet today presents people with abundant choices to choose from. Recommending choices with an emphasis on people's preferences has become increasingly sought.
Chandrashekar, Rohan (author)
core
Labeling, Covering and Decomposing of Graphs — Smarandache’s Notion in Graph Theory [PDF]
, 2010 This paper surveys the applications of Smarandache’s notion to graph theory appeared in International J.Math.Combin. from Vol.1,2008 to Vol.3,2009.
Mao, Linfan, Linfan Mao
core +1 more source