Forbidden Subgraphs of Bigraphs of Ferrers Dimension 2

2017 ◽  
pp. 38-49
Author(s):  
Ashok Kumar Das ◽  
Ritapa Chakraborty
Keyword(s):  
Forbidden Subgraphs ◽  
Dimension 2 ◽  
Ferrers Dimension

scholarly journals Bigraphs/digraphs of Ferrers dimension 2 and asteroidal triple of edges

2005 ◽  
Vol 295 (1-3) ◽  
pp. 191-195 ◽  
Author(s):  
Ashok Kr. Das ◽  
Malay Kr. Sen
Keyword(s):  
Dimension 2 ◽  
Asteroidal Triple ◽  
Ferrers Dimension

scholarly journals Toughness, Forbidden Subgraphs and Pancyclicity

2021 ◽  
Vol 37 (3) ◽  
pp. 839-866
Author(s):  
Wei Zheng ◽  
Hajo Broersma ◽  
Ligong Wang
Keyword(s):  
Recent Article ◽  
Forbidden Subgraph ◽  
Forbidden Subgraphs ◽  
Free Graph ◽  
Induced Subgraph ◽  
Complete Answer ◽  
Open Case

AbstractMotivated by several conjectures due to Nikoghosyan, in a recent article due to Li et al., the aim was to characterize all possible graphs H such that every 1-tough H-free graph is hamiltonian. The almost complete answer was given there by the conclusion that every proper induced subgraph H of $$K_1\cup P_4$$ K 1 ∪ P 4 can act as a forbidden subgraph to ensure that every 1-tough H-free graph is hamiltonian, and that there is no other forbidden subgraph with this property, except possibly for the graph $$K_1\cup P_4$$ K 1 ∪ P 4 itself. The hamiltonicity of 1-tough $$K_1\cup P_4$$ K 1 ∪ P 4 -free graphs, as conjectured by Nikoghosyan, was left there as an open case. In this paper, we consider the stronger property of pancyclicity under the same condition. We find that the results are completely analogous to the hamiltonian case: every graph H such that any 1-tough H-free graph is hamiltonian also ensures that every 1-tough H-free graph is pancyclic, except for a few specific classes of graphs. Moreover, there is no other forbidden subgraph having this property. With respect to the open case for hamiltonicity of 1-tough $$K_1\cup P_4$$ K 1 ∪ P 4 -free graphs we give infinite families of graphs that are not pancyclic.

scholarly journals Counting and equidistribution in quaternionic Heisenberg groups

2021 ◽  
pp. 1-38
Author(s):  
JOUNI PARKKONEN ◽  
FRÉDÉRIC PAULIN
Keyword(s):  
Hyperbolic Geometry ◽  
Quaternion Algebra ◽  
Rational Points ◽  
Hyperbolic Spaces ◽  
Heisenberg Groups ◽  
Arithmetic Groups ◽  
Hermitian Forms ◽  
Dimension 2 ◽  
Counting Formula ◽  
The Relationship

Abstract We develop the relationship between quaternionic hyperbolic geometry and arithmetic counting or equidistribution applications, that arises from the action of arithmetic groups on quaternionic hyperbolic spaces, especially in dimension 2. We prove a Mertens counting formula for the rational points over a definite quaternion algebra A over ${\mathbb{Q}}$ in the light cone of quaternionic Hermitian forms, as well as a Neville equidistribution theorem of the set of rational points over A in quaternionic Heisenberg groups.

scholarly journals GRADED TWISTED CALABI–YAU ALGEBRAS ARE GENERALIZED ARTIN–SCHELTER REGULAR

2021 ◽  
pp. 1-54
Author(s):  
MANUEL L. REYES ◽  
DANIEL ROGALSKI
Keyword(s):  
Regularity Property ◽  
Graded Algebra ◽  
General Study ◽  
Locally Finite ◽  
Tensor Algebras ◽  
Finite Dimensional ◽  
Dimension 2 ◽  
Separable Algebras ◽  
Gk Dimension

Abstract This is a general study of twisted Calabi–Yau algebras that are $\mathbb {N}$ -graded and locally finite-dimensional, with the following major results. We prove that a locally finite graded algebra is twisted Calabi–Yau if and only if it is separable modulo its graded radical and satisfies one of several suitable generalizations of the Artin–Schelter regularity property, adapted from the work of Martinez-Villa as well as Minamoto and Mori. We characterize twisted Calabi–Yau algebras of dimension 0 as separable k-algebras, and we similarly characterize graded twisted Calabi–Yau algebras of dimension 1 as tensor algebras of certain invertible bimodules over separable algebras. Finally, we prove that a graded twisted Calabi–Yau algebra of dimension 2 is noetherian if and only if it has finite GK dimension.

scholarly journals Who Gets what and how Does it Matter? Importance-Weighted Portfolio Allocation and Coalition Support in Brazil

2018 ◽  
Vol 10 (3) ◽  
pp. 99-134 ◽  
Author(s):  
Mariana Batista
Keyword(s):  
Positive Relationship ◽  
Portfolio Allocation ◽  
Weighted Portfolio ◽  
Dimension 2 ◽  
Legislative Support ◽  
Presidential Systems

Who gets what in portfolio allocation, and how does it matter to coalition partners’ legislative support in presidential systems? I propose that portfolios are not all alike, and that their allocation as well as the support for the president's agenda depends on the particular distribution of assets within the executive. The portfolio share allocated to coalition parties is weighted by a measure of importance based on the assets controlled by the ministry in question, such as policies, offices, and budgets. Once the weighted allocation of ministries has been identified, the results show that: 1) the president concentrates the most important ministries in their own party, mainly considering the policy dimension; 2) the positive relationship between portfolio allocation and legislative support remains, with the importance of specific dimensions being considered; and, 3) coalition partners do not respond differently in terms of legislative support in light of the different assets’ distribution within the portfolio allocation.

scholarly journals Forbidden subgraphs of graphs uniquely Hamiltonian-connected from a vertex

1998 ◽  
Vol 187 (1-3) ◽  
pp. 281-290 ◽  
Author(s):  
George R.T. Hendry ◽  
C.J. Knickerbocker ◽  
Patti Frazer Lock ◽  
Michael Sheard
Keyword(s):  
Forbidden Subgraphs ◽  
Hamiltonian Connected

scholarly journals A Quasi-Hole Detection Algorithm for Recognizing k-Distance-Hereditary Graphs, with k < 2

Algorithms ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 105
Author(s):  
Serafino Cicerone
Keyword(s):  
Polynomial Time ◽  
Detection Algorithm ◽  
Recognition Algorithm ◽  
Forbidden Subgraphs ◽  
Induced Subgraph ◽  
Hole Detection

Cicerone and Di Stefano defined and studied the class of k-distance-hereditary graphs, i.e., graphs where the distance in each connected induced subgraph is at most k times the distance in the whole graph. The defined graphs represent a generalization of the well known distance-hereditary graphs, which actually correspond to 1-distance-hereditary graphs. In this paper we make a step forward in the study of these new graphs by providing characterizations for the class of all the k-distance-hereditary graphs such that k<2. The new characterizations are given in terms of both forbidden subgraphs and cycle-chord properties. Such results also lead to devise a polynomial-time recognition algorithm for this kind of graph that, according to the provided characterizations, simply detects the presence of quasi-holes in any given graph.

Perceiving Hierarchical Structures in Nonrepresentational Paintings

1998 ◽  
Vol 16 (1) ◽  
pp. 59-70 ◽  
Author(s):  
Tsion Avital ◽  
Gerald C. Cupchik
Keyword(s):  
Factor Analysis ◽  
Multidimensional Scaling ◽  
Hierarchical Structure ◽  
Hierarchical Structures ◽  
Exploratory Activity ◽  
Affective Responses ◽  
Hierarchical Complexity ◽  
The Hierarchical Structure ◽  
Relative Separation ◽  
Dimension 2

A series of four experiments were conducted to examine viewer perceptions of three sets of five nonrepresentational paintings. Increased complexity was embedded in the hierarchical structure of each set by carefully selecting colors and ordering them in each successive painting according to certain rules of transformation which created hierarchies. Experiment 1 supported the hypothesis that subjects would discern the hierarchical complexity underlying the sets of paintings. In Experiment 2 viewers rated the paintings on collative (complexity, disorder) and affective (pleasing, interesting, tension, and power) scales, and a factor analysis revealed that affective ratings were tied to complexity (Factor 1) but not to disorder (Factor 2). In Experiment 3, a measure of exploratory activity (free looking time) was correlated with complexity (Factor 1) but not with disorder (Factor 2). Multidimensional scaling was used in Experiment 4 to examine perceptions of the paintings seen in pairs. Dimension 1 contrasted Soft with Hard-Edged paintings, while Dimension 2 reflected the relative separation of figure from ground in these paintings. Together these results show that untrained viewers can discern hierarchical complexity in paintings and that this quality stimulates affective responses and exploratory activity.

Sign in / Sign up

Export Citation Format

Share Document