Results 21 to 30 of about 58,065 (305)
TD-H2H: Shortest Path Query on Time-Dependent Graphs [PDF]
Jisuanji kexue yu tansuo, 2023 A shortest path query on road networks is a fundamental problem, which has been studied widely. Existing studies usually model road networks as a static graph and query the path with the shortest distance between given vertices.
LI Xinling, WANG Yishu, YUAN Ye, GU Xiang, WANG Guoren
doaj +1 more source
α_{2}-labeling of graphs [PDF]
Opuscula Mathematica, 2009 We show that if a graph \(G\) on \(n\) edges allows certain special type of rosy labeling (a.k.a. \(\rho\)-labeling), called \(\alpha_2\)-labeling, then for any positive integer \(k\) the complete graph \(K_{2nk+1}\) can be decomposed into copies of \(G\)
Dalibor Fronček
doaj +1 more source
Some results on Steiner decomposition number of graphs
Kuwait Journal of Science, 2023 Let $G$ be a connected graph with Steiner number $s(G)$. A decomposition $\pi=\{G_1, G_2,..., G_n\}$ is said to be a Steiner decomposition if $s(G_i)=s(G)$ for all $i\:(1\leq i\leq n)$. The maximum cardinality obtained for the Steiner decomposition $\pi$
E.Ebin Raja Merly, M.Mahiba
doaj +1 more source
The Spectrum Problem for the Connected Cubic Graphs of Order 10
Discussiones Mathematicae Graph Theory, 2021 We show that if G is a connected cubic graph of order 10, then there exists a G-decomposition of Kv if and only if v ≣ 1 or 10 (mod 15) except when v = 10 and G is one of 5 specific graphs.
Adams Peter +3 more
doaj +1 more source
Hyperspectral Image Super-Resolution Algorithm Based on Graph Regular Tensor Ring Decomposition
Remote Sensing, 2023 This paper introduces a novel hyperspectral image super-resolution algorithm based on graph-regularized tensor ring decomposition aimed at resolving the challenges of hyperspectral image super-resolution.
Shasha Sun +5 more
doaj +1 more source
Edge-partitioning graphs into regular and locally irregular components [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 A graph is locally irregular if every two adjacent vertices have distinct degrees. Recently, Baudon et al. introduced the notion of decomposition into locally irregular subgraphs.
Julien Bensmail, Brett Stevens
doaj +1 more source
Automorphic Decompositions of Graphs
Graphs and Combinatorics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Beeler, Robert A., Jamison, Robert E.
openaire +3 more sources
Decomposition of Graphs on Surfaces
Journal of Combinatorial Theory, Series B, 1997 For \(G= (V,E)\) an Eulerian graph imbedded on a triangulizable surface \(S\), \(\text{mincr}(G, D)\) denotes the minimum number of intersections of \(G\) and \(D'\) (counting multiplicities), where \(D'\) ranges over all closed curves freely homotopic to \(D\) and not intersecting \(V\).
de Graaf, M., Schrijver, A.
openaire +5 more sources
Structural Decomposition Model for the Evolution of AS-Level Internet Topologies
IEEE Access, 2020 Modeling Internet graphs at the autonomous-system (AS) level is helpful for recognizing and predicting the development trend of evolving Internet topology from a macro perspective.
Bo Jiao, Wensheng Zhang
doaj +1 more source
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