Results 81 to 90 of about 5,251,465 (203)
On hamiltonian line-graphs [PDF]
Transactions of the American Mathematical Society, 1968 Introduction. The line-graph L(G) of a nonempty graph G is the graph whose point set can be put in one-to-one correspondence with the line set of G in such a way that two points of L(G) are adjacent if and only if the corresponding lines of G are adjacent.
openaire +1 more source
Graph Homomorphism Revisited for Graph Matching [PDF]
, 2010 In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing
Li, Jianzhong +4 more
core
Reactivity effects of concurrent verbalisation during a graph comprehension task [PDF]
, 2013 We report an experiment investigating how concurrent verbalisation during a task can affect performance (a so-called “reactivity” effect). Participants studied three-variable line graphs while (a) concurrently thinking aloud or (b) silently studied the ...
Ali, Nadia, Peebles, David
core +3 more sources
The Journal of Symbolic LogicAbstract We characterize Borel line graphs in terms of 10 forbidden induced subgraphs, namely the nine finite graphs from the classical result of Beineke together with a 10th infinite graph associated with the equivalence relation $\mathbb {E}_0$ on the Cantor space.
JAMES ANDERSON, ANTON BERNSHTEYN
openaire +2 more sources
Forcing (G,D)-number of a Graph [PDF]
, 2011 By a graph G=(V,E), we mean a finite, undirected connected graph without loops and multiple ...
Nagarajan, A. +3 more
core +1 more source
Cogent EngineeringA graph’s b-coloring admits proper coloring and has the extra characteristic of having a dominating node in each color-class in the graph. [Formula: see text] the b-chromatic number, is the largest integer k for which G can be colored with k colors using
Foram Chandarana +5 more
doaj +1 more source
Collapsible graphs and reductions of line graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Zhi-Hong +2 more
openaire +3 more sources
Coalition structures induced by the strength of a graph [PDF]
We study cooperative games associated with a communication structure which takes into account a level of communication between players. Let us consider an undirected communication graph : each node represents a player and there is an edge between two ...
Michel Grabisch, Alexandre Skoda
core
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
ncRPI-LGAT: Prediction of ncRNA-protein interactions with line graph attention network framework. [PDF]
Comput Struct Biotechnol J, 2023 Han Y, Zhang SW.
europepmc +1 more source