Results 11 to 20 of about 1,370,090 (279)
Incidence matrices and line graphs of mixed graphs
Special Matrices, 2023 In the theory of line graphs of undirected graphs, there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, there exists no analogous result.
Abudayah Mohammad +2 more
doaj +1 more source
Line game-perfect graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe $[X,Y]$-edge colouring game is played with a set of $k$ colours on a graph $G$ with initially uncoloured edges by two players, Alice (A) and Bob (B). The players move alternately. Player $X\in\{A,B\}$ has the first move. $Y\in\{A,B,-\}$.
Stephan Dominique Andres, Wai Lam Fong
doaj +1 more source
Strongly Monotone Drawings of Planar Graphs [PDF]
, 2016 A straight-line drawing of a graph is a monotone drawing if for each pair of vertices there is a path which is monotonically increasing in some direction, and it is called a strongly monotone drawing if the direction of monotonicity is given by the ...
Felsner, Stefan +5 more
core +2 more sources
Mapana - Journal of Sciences, 2010 For a graph G, let G, L(G), J(G) S(G), L,(G) and M(G) denote Complement, Line graph, Jump graph, Splitting graph, Line splitting graph and Middle graph respectively. In this paper, we solve the graph equations L(G) =S(H), M(G) = S(H), L(G) = LS(H), M(G) =LS(H), J(G) = S(H), M(G) = S(H), J(G) = LS(H) and M(G) = LS(G).
B. Basavanagoud, Veena Mathad
openaire +2 more sources
Walk entropies on graphs [PDF]
, 2014 Entropies based on walks on graphs and on their line-graphs are defined. They are based on the summation over diagonal and off-diagonal elements of the thermal Green’s function of a graph also known as the communicability. The walk entropies are strongly
de la Peña, José A. +2 more
core +1 more source
The gamma-Signless Laplacian Adjacency Matrix of Mixed Graphs
Theory and Applications of Graphs, 2023 The α-Hermitian adjacency matrix Hα of a mixed graph X has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number α.
Omar Alomari +2 more
doaj +1 more source
, 2016 A mixed graph can be seen as a type of digraph containing some edges (or two opposite arcs). Here we introduce the concept of sequence mixed graphs, which is a generalization of both sequence graphs and literated line digraphs.
Dalfó Simó, Cristina +2 more
core +3 more sources
Encapsulation structure and dynamics in hypergraphs
Journal of Physics: Complexity, 2023 Hypergraphs have emerged as a powerful modeling framework to represent systems with multiway interactions, that is systems where interactions may involve an arbitrary number of agents. Here we explore the properties of real-world hypergraphs, focusing on
Timothy LaRock, Renaud Lambiotte
doaj +1 more source
Characterizing ‐perfect line graphs [PDF]
International Transactions in Operational Research, 2016 AbstractThe aim of this paper is to study the Lovász‐Schrijver PSD operator applied to the edge relaxation of the stable set polytope of a graph. We are particularly interested in the problem of characterizing graphs for which generates the stable set polytope in one step, called ‐perfect graphs.
Escalante, Mariana Silvina +2 more
openaire +5 more sources
Line-distortion, Bandwidth and Path-length of a graph [PDF]
, 2014 We investigate the minimum line-distortion and the minimum bandwidth problems on unweighted graphs and their relations with the minimum length of a Robertson-Seymour's path-decomposition.
A. Gupta +15 more
core +1 more source