Results 21 to 30 of about 5,414,210 (302)
On Pathos Semitotal and Total Block Graph of a Tree [PDF]
, 2011 The concept of pathos of a graph G was introduced by Harary [2], as a collection of minimum number of line disjoint open paths whose union is G. The path number of a graph G is the number of paths in pathos.
Muddebihal M. H.
core +1 more source
The H-Line Signed Graph of a Signed Graph [PDF]
, 2010 For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required.
Reddy, Siva Kota +2 more
core +1 more source
A Polynomial Kernel for Line Graph Deletion [PDF]
, 2020 The line graph of a graph G is the graph L(G) whose vertex set is the edge set of G and there is an edge between e,f ∈ E(G) if e and f share an endpoint in G. A graph is called line graph if it is a line graph of some graph.
Eiben, Eduard, Lochet, William
core +1 more source
Discrete Mathematics, 2011 Boxicity of a graph H, denoted by box(H), is the minimum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in R^k. In this paper, we show that for a line graph G of a multigraph, box(G) <= 2Δ(\lceil log_2(log_2(Δ)) \rceil + 3) + 1, where Δdenotes the maximum degree of G.
L. Sunil Chandran +2 more
openaire +5 more sources
Expert interpretation of bar and line graphs: The role of graphicacy in reducing the effect of graph format. [PDF]
, 2015 The distinction between informational and computational equivalence of representations, first articulated by Larkin and Simon (1987) has been a fundamental principle in the analysis of diagrammatic reasoning which has been supported empirically on ...
Ali, Nadia +6 more
core +1 more source
AKCE International Journal of Graphs and Combinatorics, 2021 Let be a graph. A local edge coloring of G is a proper edge coloring such that for each subset S of E(G) with there exist edges such that where ns is the number of copies of P3 in the edge induced subgraph The maximum color assigned by a local edge ...
P. Deepa +2 more
doaj +1 more source
On Automorphisms of Line-graphs
European Journal of Combinatorics, 1980 This paper generalizes some results on hypergraph reconstruction due to \textit{C. Berge} [C. R. Acad. Sci., Paris, Ser. A 274, 1783-1786 (1972; Zbl 0236.05129)] and \textit{J.C.Fournier} [Proc. 1rst Working Sem. Hypergraphs, Columbus 1972, Lecture Notes Math. 411, 95-98 (1974; Zbl 0302.05113)].
Péter L. Erdös, Zoltán Füredi
openaire +2 more sources
Electronic Notes in Discrete Mathematics, 2010 Abstract We observe that ω ( G ) + χ ( S ( G → ) ) = n = ω ( S ( G → ) ) + χ ( G ) for any graph G with n vertices, where G → is any acyclic orientation of G and where S ( G → ) is the (complement of the) auxiliary line graph introduced in [Cornaz, D., and Jost, V., A one-to-one ...
Cornaz, Denis, Meurdesoif, Philippe
openaire +3 more sources
, 2009 For standard terminology and notion in graph theory we refer the reader to Harary [7]; the non-standard will be given in this paper as and when required.
Reddy, P. Siva Kota +3 more
core +1 more source
The Line n-Sigraph of a Symmetric n-Sigraph-IV [PDF]
, 2012 Unless mentioned or defined otherwise, for all terminology and notion in graph theory the reader is refer to [6].
Reddy, P. Siva Kota +2 more
core +1 more source