Results 81 to 90 of about 1,939,159 (235)
Line and Subdivision Graphs Determined by
Mathematics, 2019 Let T 4 = { ± 1 , ± i } be the subgroup of fourth roots of unity inside T , the multiplicative group of complex units. For a T 4 -gain graph Φ = ( Γ , T 4 , φ ) , we introduce gain functions on ...
Abdullah Alazemi +4 more
doaj +1 more source
Minimizing the Cost of Team Exploration
, 2019 A group of mobile agents is given a task to explore an edge-weighted graph $G$, i.e., every vertex of $G$ has to be visited by at least one agent. There is no centralized unit to coordinate their actions, but they can freely communicate with each other ...
BL Golden +13 more
core +1 more source
On clique immersions in line graphs [PDF]
, 2020 Michael Guyer, Jessica McDonald
openalex +1 more source
Almost borderenergetic line graphs
Discrete Mathematics, Algorithms and ApplicationsThe energy of a graph is calculated by summing the absolute values of the eigenvalues found in its adjacency matrix. In this study, we present examples of line graphs with energy equivalent to the energy of a complete graph, which are called the borderenergetic graphs.
Cahit Dede, Ayşe Dilek Maden
openaire +2 more sources
Line graph contrastive learning for node classification
Journal of King Saud University: Computer and Information SciencesExisting graph contrastive learning methods often rely on differences in node features within subgraphs, lacking effective capture of the global structural information of the graph.
Mingyuan Li +5 more
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2015 A signed graph (or sigraph for short) is an ordered pair S = (Su,σ), where Su is a graph, G = (V,E), called the underlying graph of S and σ : E → {+,−} is a function from the edge set E of Su into the set {+,−}.
Sinha Deepa, Dhama Ayushi
doaj +1 more source
Perfect Set of Euler Tours of Kp,p,p
Discussiones Mathematicae Graph Theory, 2016 Bermond conjectured that if G is Hamilton cycle decomposable, then L(G), the line graph of G, is Hamilton cycle decomposable. In this paper, we construct a perfect set of Euler tours for the complete tripartite graph Kp,p,p for any prime p and hence ...
Govindan T., Muthusamy A.
doaj +1 more source
Hypergraph Learning with Line Expansion
, 2020 Previous hypergraph expansions are solely carried out on either vertex level or hyperedge level, thereby missing the symmetric nature of data co-occurrence, and resulting in information loss.
Abdelzaher, Tarek +3 more
core
Glasgow Mathematical Journal, 1976 In this paper all graphs will be ordinary graphs, i.e. finite, undirected, and without loops or multiple edges. For points x and y of a graph G, we shall indicate that x is adjacent to y by writing x ⊥ y, and if x is not adjacent to y we shall write xy.
openaire +2 more sources
Extension of Space Syntax Methods to Generic Urban Variables
Urban Science, 2018 We studied generalization of a method for extending configurational studies to variables that are not exclusively geographical, in order to allow investigation of generic relationships in the built environment.
Roberto D’Autilia, Marco Spada
doaj +1 more source