Results 61 to 70 of about 1,353,416 (150)
Flat foldings of plane graphs with prescribed angles and edge lengths
Journal of Computational Geometry, 2018 When can a plane graph with prescribed edge lengths and prescribed angles (from among $\{0,180^\circ, 360^\circ\}$) be folded flat to lie in an infinitesimally thick line, without crossings?
Zachary Abel +5 more
doaj +1 more source
On the Laplacian spectral radii of Halin graphs
Journal of Inequalities and Applications, 2017 Let T be a tree with at least four vertices, none of which has degree 2, embedded in the plane. A Halin graph is a plane graph constructed by connecting the leaves of T into a cycle. Thus the cycle C forms the outer face of the Halin graph, with the tree
Huicai Jia, Jie Xue
doaj +1 more source
Genus Distribution for a Graph [PDF]
, 2009 In this paper we develop the technique of a distribution decomposition for a graph. A formula is given to determine genus distribution of a cubic graph.
Liangxia, Wan +2 more
core +1 more source
Unique-Maximum Coloring Of Plane Graphs
Discussiones Mathematicae Graph Theory, 2016 A unique-maximum k-coloring with respect to faces of a plane graph G is a coloring with colors 1, . . . , k so that, for each face of G, the maximum color occurs exactly once on the vertices of α.
Fabrici Igor, Göring Frank
doaj +1 more source
Tulgeity of Line, Middle and Total Graph of Wheel Graph Families [PDF]
, 2010 Tulgeity r(G) is the maximum number of disjoint, point induced, non acyclic subgraphs contained in G. In this paper one finds the tulgeity of line, middle and total graph of wheel graph, Gear graph and Helm ...
Vernold, Vivin +2 more
core +1 more source
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths [PDF]
, 2014 When can a plane graph with prescribed edge lengths and prescribed angles (from among {0,180°, 360°}) be folded flat to lie in an infinitesimally thick line, without crossings?
David Eppstein +13 more
core +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
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
Odd facial total-coloring of unicyclic plane graphs [PDF]
Discrete Mathematics Letters, 2022 Július Czap
doaj +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