Results 41 to 50 of about 4,550,446 (348)
Heliyon, 2023 The tessellation problem is interesting to study, especially when it is associated with mathematical concepts. In this study, a graph coloring technique will be applied to solve the problem of wallpaper tessellation decoration. The main objective of this
Dafik +4 more
doaj +1 more source
Mapana - Journal of Sciences, 2010 For a graph G, let G, L(G), J(G) S(G), L,(G) and M(G) denote Complement, Line graph, Jump graph, Splitting graph, Line splitting graph and Middle graph respectively. In this paper, we solve the graph equations L(G) =S(H), M(G) = S(H), L(G) = LS(H), M(G) =LS(H), J(G) = S(H), M(G) = S(H), J(G) = LS(H) and M(G) = LS(G).
B. Basavanagoud, Veena Mathad
openaire +2 more sources
Filtering Random Graph Processes Over Random Time-Varying Graphs [PDF]
, 2017 Graph filters play a key role in processing the graph spectra of signals supported on the vertices of a graph. However, despite their widespread use, graph filters have been analyzed only in the deterministic setting, ignoring the impact of stochastic ...
Isufi, Elvin +3 more
core +3 more sources
Graph Neural Networks for Social Recommendation [PDF]
The Web Conference, 2019 In recent years, Graph Neural Networks (GNNs), which can naturally integrate node information and topological structure, have been demonstrated to be powerful in learning on graph data.
Wenqi Fan +6 more
semanticscholar +1 more source
Generation of colored graphs with isomorphism rejection [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2021 In the article we consider graphs whose vertices or edges are colored in a given number of colors — vertex and edge colorings. The study of colorings of graphs began in the middle of the 19th century, but the main attention is paid to proper ...
Razumovsky, Peter Vladimirovich +1 more
doaj +1 more source
Packing Smaller Graphs into a Graph
Discrete Mathematics, 1989 Let G be a connected graph and \(\alpha_ m(G)\) denote the largest number of vertex-disjoint connected subgraphs \(H_ 1,H_ 2,...,H_ k\) of G each having m vertices. The authors obtain the following bounds for the m-packing number \(\alpha_ m(G)\) for a connected graph G of order n and maximum degree \(\Delta\). \[ \lceil \frac{n-m+1}{(m-1)(\Delta -1)+1}
Akiyama, Jin +2 more
openaire +2 more sources
Planar Graphs as VPG-Graphs [PDF]
Journal of Graph Algorithms and Applications, 2013 Summary: A graph is \(B_k\)-VPG when it has an intersection representation by paths in a rectangular grid with at most \(k\) bends (turns). It is known that all planar graphs are \(B_3\)-VPG and this was conjectured to be tight. We disprove this conjecture by showing that all planar graphs are \(B_2\)-VPG.
Chaplick, Steven, Ueckerdt, Torsten
openaire +3 more sources
Graphs Cospectral with Kneser Graphs [PDF]
SSRN Electronic Journal, 2009 AMS Subject Classification ...
Haemers, W.H., Ramezani, F.
openaire +5 more sources
Not All Graphs are Segment T-graphs
European Journal of Combinatorics, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alon, Noga +2 more
openaire +1 more source
Annals of Pure and Applied Logic, 2017 In two previous papers, we exposed a combinatorial approach to the program of Geometry of Interaction, a program initiated by Jean-Yves Girard. The strength of our approach lies in the fact that we interpret proofs by simpler structures - graphs - than Girard's constructions, while generalizing the latter since they can be recovered as special cases of
openaire +4 more sources