A characterization of graphs with given maximum degree and smallest possible matching number: II

2022 ◽  
Vol 345 (3) ◽  
pp. 112731
Author(s):  
Michael A. Henning ◽  
Zekhaya B. Shozi
Keyword(s):  
Maximum Degree ◽  
Matching Number

A characterization of graphs with given maximum degree and smallest possible matching number

2021 ◽  
Vol 344 (7) ◽  
pp. 112426
Author(s):  
Michael A. Henning ◽  
Zekhaya B. Shozi
Keyword(s):  
Maximum Degree ◽  
Matching Number

The Image of the Accountant in a German Context

2004 ◽  
Vol 4 (1) ◽  
pp. 62-89 ◽  
Author(s):  
Andreas Hoffjan
Keyword(s):  
Content Analysis ◽  
Empirical Study ◽  
Cost Reduction ◽  
Maximum Degree ◽  
Work Ethic ◽  
Personal Characteristics ◽  
Management Accountant ◽  
The Subject ◽  
Professional Context

This study introduces content analysis as a method of examining the accountant's role. The empirical study is based on 73 advertisements, which are directed primarily at employees who are affected by the management accountant's work. The findings of the study indicate that the subject of accountancy is used particularly in connection with promises of “cost reduction.” Consequently, the majority of advertisements use the accountant stereotype of “savings personified.” In a professional context, the work ethic of the management accountant is given particular emphasis in the advertisements. He/she identifies him/herself with his/her task to the maximum degree, is regarded as loyal to his/her company and, for the most part, is well organized in his/her work. However, the characterization of the management accountant as a well disciplined company-person conflicts with the negative portrayal of his/her professional qualities. In advertisements, the management accountant is portrayed as a rather inflexible, passive, and uncreative specialist who, as a result of these qualities, often demotivates others. The personal characteristics of the management accountant are shown in a negative light. This gives him/her the unappealing image of a humorless, envious, dissociated, and ascetic corporate-person.

scholarly journals A characterization of some graphs with metric dimension two

2017 ◽  
Vol 09 (02) ◽  
pp. 1750027
Author(s):  
Ali Behtoei ◽  
Akbar Davoodi ◽  
Mohsen Jannesari ◽  
Behnaz Omoomi
Keyword(s):  
Maximum Degree ◽  
Chordal Graph ◽  
Metric Dimension ◽  
Resolving Set ◽  
Unique Pair ◽  
Clique Separators

A set [Formula: see text] is called a resolving set, if for each pair of distinct vertices [Formula: see text] there exists [Formula: see text] such that [Formula: see text], where [Formula: see text] is the distance between vertices [Formula: see text] and [Formula: see text]. The cardinality of a minimum resolving set for [Formula: see text] is called the metric dimension of [Formula: see text] and is denoted by [Formula: see text]. A [Formula: see text]-tree is a chordal graph all of whose maximal cliques are the same size [Formula: see text] and all of whose minimal clique separators are also all the same size [Formula: see text]. A [Formula: see text]-path is a [Formula: see text]-tree with maximum degree [Formula: see text], where for each integer [Formula: see text], [Formula: see text], there exists a unique pair of vertices, [Formula: see text] and [Formula: see text], such that [Formula: see text]. In this paper, we prove that if [Formula: see text] is a [Formula: see text]-path, then [Formula: see text]. Moreover, we provide a characterization of all [Formula: see text]-trees with metric dimension two.

scholarly journals On Different "Middle Parts" of a Tree

10.37236/6408 ◽  
2018 ◽  
Vol 25 (3) ◽  
Author(s):  
Heather Smith ◽  
László Székely ◽  
Hua Wang ◽  
Shuai Yuan
Keyword(s):  
Maximum Degree ◽  
Rooted Tree ◽  
Maximum Distance ◽  
Partial Characterization ◽  
Extremal Structure

We determine the maximum distance between any two of the center, centroid, and subtree core among trees with a given order. Corresponding results are obtained for trees with given maximum degree and also for trees with given diameter. The problem of the maximum distance between the centroid and the subtree core among trees with given order and diameter becomes difficult. It can be solved in terms of the problem of minimizing the number of root-containing subtrees in a rooted tree of given order and height. While the latter problem remains unsolved, we provide a partial characterization of the extremal structure.

A CHARACTERIZATION OF k-TH POWERS Pn,k OF PATHS IN TERMS OF k-TREES

2001 ◽  
Vol 12 (04) ◽  
pp. 435-443 ◽  
Author(s):  
Koich Yamazaki ◽  
Sei'ichi Tani ◽  
Tetsuro Nishino
Keyword(s):  
Maximum Degree

Let G be a k-tree such that |{v ∈ V(G): degG(v) = k}| = 2, n = |V(G)| ≥ 2k + 2, and the maximum degree of G is at most 2k. In this paper, we will show that such a k-tree G is isomorphic to Pn,k. In this way, we give a new characterization of k-th power (i.e. Pn,k) of paths with n vertices in terms of k-trees.

scholarly journals Face-Degree Bounds for Planar Critical Graphs

10.37236/5895 ◽  
2016 ◽  
Vol 23 (3) ◽  
Author(s):  
Ligang Jin ◽  
Yingli Kang ◽  
Eckhard Steffen
Keyword(s):  
Planar Graph ◽  
Chromatic Number ◽  
Planar Graphs ◽  
Maximum Degree ◽  
Upper Bounds ◽  
Partial Characterization ◽  
Critical Graphs ◽  
Degree Bounds

The only remaining case of a well known conjecture of Vizing states that there is no planar graph with maximum degree 6 and edge chromatic number 7. We introduce parameters for planar graphs,  based on the degrees of the faces, and study the question whether there are upper bounds for these parameters for planar edge-chromatic critical graphs. Our results provide upper bounds on these parameters for smallest counterexamples to Vizing's conjecture, thus providing a partial characterization of such graphs, if they exist.For $k \leq 5$ the results give insights into the structure of planar edge-chromatic critical graphs.

Sign in / Sign up

Export Citation Format

Share Document