Results 11 to 20 of about 1,282,116 (277)
Graph Theory and Algorithms for Network Analysis [PDF]
E3S Web of Conferences, 2023 In network analysis, the study and comprehension of complex systems in numerous fields, such as social networks, transportation networks, and biological networks, are made possible by the crucial role played by graph theory and algorithms.
Arul Sharmila Mary +5 more
doaj +1 more source
Symmetry, 2018 This book contains the successful invited submissions [1–10] to a special issue of Symmetry on the subject area of ‘graph theory’ [...]
openaire +3 more sources
Further results on local inclusive distance vertex irregularity strength of graphs
Electronic Journal of Graph Theory and Applications, 2023 Let G = (V, E) be a simple undirected graph. A labeling f : V(G)→{1, …, k} is a local inclusive d-distance vertex irregular labeling of G if every adjacent vertices x, y ∈ V(G) have distinct weights, with the weight w(x),x ∈ V(G) is the sum of every ...
Fawwaz Fakhrurrozi Hadiputra +3 more
doaj +1 more source
Graceful labeling construction for some special tree graph using adjacency matrix
Electronic Journal of Graph Theory and Applications, 2023 In 1967, Rosa introduced β − labeling which was then popularized by Golomb under the name graceful. Graceful labeling on a graph G is an injective function f : V(G)→{0, 1, 2, …, |E(G)|} such that, when each edge uv ∈ E(G) is assigned the label |f(u)−f(v)|
Nikson Simarmata +2 more
doaj +1 more source
The total vertex irregularity strength of symmetric cubic graphs of the Foster's Census
Indonesian Journal of Combinatorics, 2022 Foster (1932) performed a mathematical census for all connected symmetric cubic (trivalent) graphs of order n with n ≤ 512. This census then was continued by Conder et al. (2006) and they obtained the complete list of all connected symmetric cubic graphs
Rika Yanti +3 more
doaj +1 more source
On the strong beta-number of galaxies with three and four components
AKCE International Journal of Graphs and Combinatorics, 2020 The beta-number of a graph is the smallest positive integer for which there exists an injective function such that each is labeled and the resulting set of edge labels is for some positive integer . The beta-number of is if there exists no such integer .
Rikio Ichishima +2 more
doaj +1 more source
The consecutively super edge-magic deficiency of graphs and related concepts
Electronic Journal of Graph Theory and Applications, 2020 A bipartite graph G with partite sets X and Y is called consecutively super edge-magic if there exists a bijective function f : V(G) ⋃ E(G) → {1,2,...,|V(G)| + |E(G)|} with the property that f(X) = {1,2,...,|X|}, f(Y) = {|X|+1, |X|+2,...,|V(G)|} and f(u)+
Rikio Ichishima +2 more
doaj +1 more source
Graph Grammars, Insertion Lie Algebras, and Quantum Field Theory [PDF]
, 2015 Graph grammars extend the theory of formal languages in order to model distributed parallelism in theoretical computer science. We show here that to certain classes of context-free and context-sensitive graph grammars one can associate a Lie algebra ...
Marcolli, Matilde, Port, Alexander
core +3 more sources
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a graph of order . A numbering of is a labeling that assigns distinct elements of the set to the vertices of , where each edge of is labeled .
Rikio Ichishima +2 more
doaj +1 more source
, 2020 We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the resulting set is ...
Grzesik, Andrzej +2 more
core +2 more sources