Results 31 to 40 of about 5,251,465 (203)
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
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
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
Total Minimal Dominating Signed Graph [PDF]
, 2010 Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is ...
Reddy, Siva Kota, Vijay, S.
core +1 more source
On the planarity of line Mycielskian graph of a graph
Ratio Mathematica, 2020 The line Mycielskian graph of a graph G, denoted by Lμ(G) is defined as the graph obtained from L(G) by adding q+1 new vertices E' = ei' : 1 ≤ i ≤ q and e, then for 1 ≤ i ≤ q , joining ei' to the neighbours of ei and to e.
Keerthi G. Mirajkar +1 more
doaj +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
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 +5 more
core +1 more source
On an edge partition and root graphs of some classes of line graphs
Electronic Journal of Graph Theory and Applications, 2017 The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line ...
K Pravas, A. Vijayakumar
doaj +1 more source
On the application of line graphs in quantitative structure-property studies [PDF]
Journal of the Serbian Chemical Society, 2000 Let G be a molecular graph possessing m0(G) edges. Let m1(G) be the number of edges of the line graph L(G) of G, known as the Bertz index. Let m2(G) be the number of edges of the line graph of L(G), etc.
Gutman Ivan, Tomović Željko
doaj +1 more source