Results 41 to 50 of about 2,666,039 (345)
The total face irregularity strength of some plane graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A face irregular total -labeling of a 2-connected plane graph is a labeling of vertices and edges such that their face-weights are pairwise distinct. The weight of a face under a labeling is the sum of the labels of all vertices and edges surrounding ...
Meilin I. Tilukay +3 more
doaj +1 more source
On the Line Graph of a Projective Plane [PDF]
Proceedings of the American Mathematical Society, 1963 Abstract : If G is a (finite, undirected) graph, its line graph (also called the interchange graph, and the adjoint graph) is the graph G whose vertices are the edges of G, with two vertices of G adjacent if the corresponding edges of G are adjacent.
openaire +3 more sources
Verification on a Given Point Set for a Cubic Plane Graph
, 2015 Cubic graph, where all vertices have degree three can be associated as 3-regular graph and trivalent graph. Let a point P be the given point set, with a stipulation of n ≥ 4 points in the regular plane such that n is even in general situation.
N. K. Geetha
semanticscholar +1 more source
On facial unique-maximum (edge-)coloring [PDF]
, 2017 A facial unique-maximum coloring of a plane graph is a vertex coloring where on each face $\alpha$ the maximal color appears exactly once on the vertices of $\alpha$.
Andova, Vesna +4 more
core +3 more sources
Ars Mathematica Contemporanea, 2015 A plane graph is called alternating if all adjacent vertices have different degrees, and all neighboring faces as well. Alternating plane graphs were introduced in 2008. This paper presents the previous research on alternating plane graphs. There are two smallest alternating plane graphs, having 17 vertices and 17 faces each.
Althöfer, Ingo +4 more
openaire +3 more sources
Morphing Planar Graph Drawings Optimally [PDF]
, 2014 We provide an algorithm for computing a planar morph between any two planar straight-line drawings of any $n$-vertex plane graph in $O(n)$ morphing steps, thus improving upon the previously best known $O(n^2)$ upper bound.
C. Erten +10 more
core +1 more source
Plane augmentation of plane graphs to meet parity constraints [PDF]
Applied Mathematics and Computation, 2020 A plane topological graph $G=(V,E)$ is a graph drawn in the plane whose vertices are points in the plane and whose edges are simple curves that do not intersect, except at their endpoints. Given a plane topological graph $G=(V,E)$ and a set $C_G$ of parity constraints, in which every vertex has assigned a parity constraint on its degree, either even or
Catana, J.C. +3 more
openaire +4 more sources
Succinct Greedy Graph Drawing in the Hyperbolic Plane [PDF]
International Symposium Graph Drawing and Network Visualization, 2008 We describe a method for producing a greedy embedding of any n -vertex simple graph G in the hyperbolic plane, so that a message M between any pair of vertices may be routed by having each vertex that receives M pass it to a neighbor that is closer to M '
D. Eppstein, M. Goodrich
semanticscholar +1 more source
Strong parity vertex coloring of plane graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 A strong parity vertex coloring of a 2-connected plane graph is a coloring of the vertices such that every face is incident with zero or an odd number of vertices of each color.
Tomas Kaiser +3 more
doaj +1 more source
On Some Types of Matrices for Fan Plane Graph and Their Dual
Tikrit Journal of Pure Science, 2023 This work aims to discuss the adjacency matrices, Incidence matrix and Degree matrix of some types plane graphs we usually used them, as complete graphs, cycle graph,…,ect.
Haneen Mohammed Adil, Israa Munir Tawfik
doaj +1 more source