Results 61 to 70 of about 5,251,465 (203)
On the r-dynamic coloring of some fan graph families
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021 In this paper, we determine the r-dynamic chromatic number of the fan graph Fm,n and determine sharp bounds of this graph invariant for four related families of graphs: The middle graph M(Fm,n), the total graph T (Fm,n), the central graph C(Fm,n) and the
Falcón Raúl M. +3 more
doaj +1 more source
Graphoidal graphs and graphoidal digraphs: a generalization of line graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A graphoidal cover of a graph G is a collection ψ of paths (not necessarily open) in G such that each path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ, and every edge of G is in exactly one path in Let
S. Arumugam, Jay S. Bagga
doaj +1 more source
Eulerian Cycle Decomposition Conjecture for the line graph of complete graphs
AKCE International Journal of Graphs and Combinatorics, 2019 The Eulerian Cycle Decomposition Conjecture, by Chartrand, Jordon and Zhang, states that if the minimum number of odd cycles in a cycle decomposition of an Eulerian graph of size is the maximum number of odd cycles in such a cycle decomposition is and is
R. Rajarajachozhan, R. Sampathkumar
doaj +1 more source
Computing Topological Indices and Polynomials for Line Graphs
Mathematics, 2018 A topological index is a number related to the atomic index that allows quantitative structure–action/property/toxicity connections. All the more vital topological indices correspond to certain physico-concoction properties like breaking point ...
Shahid Imran +3 more
doaj +1 more source
LeL-GNN: Learnable Edge Sampling and Line Based Graph Neural Network for Link Prediction
IEEE Access, 2023 Graph neural networks lose a lot of their computing power when more network layers are added. As a result, the majority of existing graph neural networks have a shallow depth of learning. Over-smoothing and information loss are two of the key issues that
Md Golam Morshed +2 more
doaj +1 more source
Generative Service Provisioning for IoT Devices Using Line Graph Structure
IEEE Access, 2023 A service subgraph helps Internet-of-Things devices access resources in a dynamic Internet-of-Things device network. We propose a service subgraph generation method for Internet-of-Things device networks.
Joohyun Kim, Jae-Hoon Kim
doaj +1 more source
Graph Drawing Techniques for Geographic Visualization [PDF]
, 2004 Geovisualizers often need to represent data that consists of items related together. Such data sets can be abstracted to a mathematical structure, the graph.
Rodgers, Peter
core
Discrete Mathematics, 2000 Let \(G= (V,E)\) be a simple graph. A vertex \(k\)-ranking of \(G\) is a proper vertex coloring \(\varphi: V\to\{1,\dots, k\}\) such that every path in \(G\) with endvertices \(x\) and \(y\) of the same color \(\varphi(x)= \varphi(y)\) contains a vertex \(z\) with higher color \(\varphi(z)> \varphi(x)\).
Ingo Schiermeyer +2 more
openaire +2 more sources
Split Legendary Domination in graphs
Ratio MathematicaHarary and Norman introduced the line graph L(G) . We introduced the legendary domination number by combining the domination concept both in graph and its line graph.
P. Kavitha
doaj +1 more source
Wiener Index of Graphs and Their Line Graphs [PDF]
Journal of the Operations Research Society of China, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Su, Xiaohai, Wang, Ligong, Gao, Yun
openaire +1 more source