The parameter, pendant number of a graph G , is defined as the least number of end vertices of paths in a path decomposition of the given graph and is denoted as \\( \\Pi _p(G) \\) . This paper determines the pendant number of regular graphs, complete r -partite graphs, line ...
The graph of an inequality on a number line can help students visually understand the solution to an inequality. Plotting an inequality on a number line requires a number of rules to ensure the solution is properly "translated" onto the graph. Students should pay special attention to whether th...
first-aid education first-in-last-out pri first-level spells first-line health car first-order fold first-order lag first-order linear di first-pass metabolism first-preference-scor first-principles meth first-time customer first-time home buyer first-time sales lett first-use syndrome firstaid ...
number line 数 axis 轴 lateral axis 横轴 vertical axis 纵轴 origin 原点 rectangular coordinate 直角坐标系 quadrant 象限 octant 卦 slope 斜率 5. 有关集合的名词 set 集合 element 元素 belong to 属于 not belong to 不属于 contain 包含 barring 不包含 subset 子集 empty set, null set 空集 union 并...
Extremal graphs reach the lower bound for the number of perfect matchings of line graphs Let $G=(V,E)$ be a graph and $|E|$ be even. In this paper, we consider the extremal graphs $G$ such that $M(L(G))= 2^{|E(G)|-|V(G)|+1} + \\\sum \\\limits... Z Xue,S Cai...
An octilinear drawing of a planar graph is one in which each edge is drawn as a sequence of horizontal, vertical and diagonal at 45 degrees line-segments. For such drawings to be readable, special care is needed in order to keep the number of bends small. As the problem of finding plan...
An obstacle representation of a graph G is a drawing of G in the plane with straight-line edges, together with a set of polygons (respectively, convex poly... H Alpert,KJD Laison - 《Discrete & Computational Geometry》 被引量: 51发表: 2010年 Flocking with Obstacle Avoidance In this pape...
A structural method for on-line recognition of Chinese characters is proposed, which is stroke order and stroke number free. Both input characters and the model characters are represented with complete attributed relational graphs (ARGs). A new optimal matching measure between two ARGs is defined. ...
We show that for all simple graphs G other than the cycles C_3,C_4,C_5, and the claw K_1,3 there exists a K > 0 such that whenever k > K the k-th iterate of the line graph can be distinguished by at most two colors. Additionally we determine, for trees, when the ...
On the number of perfect matchings of line graphs Let G=(V,E) be a connected graph, where E is even. In this paper we show that the line graph L(G) of G contains at least 2~(E-V+1) perfect matchings, and c... FYWZF Dong - 《Discrete Applied Mathematics》 被引量: 0发表: ...