Results 71 to 80 of about 1,343 (197)
Axiomatization and completeness of lexicographic products of modal logics [PDF]
, 2009 This paper sets out a new way of combining Kripke-complete modal logics: lexicographic product. It discusses some basic properties of the lexicographic product construction and proves axiomatization/completeness ...
Balbiani, Philippe
core +3 more sources
Operations on Intuitionistic Fuzzy Graph Structures
Fuzzy Information and Engineering, 2016 An intuitionistic fuzzy graph structure (IFGS) is a generalization of an intuitionistic fuzzy graph. The concept of intuitionistic fuzzy graph structure is introduced and investigated in this paper.
Muhammad Akram, Rabia Akmal
doaj +1 more source
L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs
AKCE International Journal of Graphs and Combinatorics, 2022 An L(2, 1)-coloring (or labeling) of a graph G is a mapping [Formula: see text] such that [Formula: see text] if [Formula: see text] and [Formula: see text] if [Formula: see text] The span of an L(2, 1)-coloring is the maximum color assigned by it.
Nibedita Mandal, Pratima Panigrahi
doaj +1 more source
Scalable Computation of Topological Abstractions for Scalar Data
Computer Graphics Forum, EarlyView.Abstract Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial ...
M. Will +6 more
wiley +1 more source
Anselm's Temporal‐Ontological Proof
Noûs, EarlyView.ABSTRACT In his Reply to Gaunilo, Anselm presented two additional arguments for the existence of God beyond those that appear in the Proslogion. In “The Logical Structure of Anselm's Argument,” Robert M. Adams isolates each. One, he develops into a modal ontological argument along the lines of other 20th century ontological arguments (e.g., those of ...
Daniel Rubio
wiley +1 more source
‘Chrystalline Talk’: Thomas Browne's Poetics of Concretion and Mineral Plain Style
Renaissance Studies, EarlyView.ABSTRACT This article charts the figuration, both material and rhetorical, of mineral bodies in early modern natural philosophy, paying particular attention to the second book of Thomas Browne's Pseudodoxia Epidemica (1646). It argues that concretions (stony calculi and crystals formed through the aggregation of physical matter) make manifest a mineral
Jess Dunmore
wiley +1 more source
On wreathed lexicographic products of graphs
Discrete Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Das lexikographische Beispiel in der Parömiographie. Formen und Funktionen
Lexikos, 2013 The Lexicographic Example in Paremiography. Forms and Functions. This paper discusses the lexicographic example within the scope of paremiography (proverb lexicography).The focus is on criteria for the identification, determination and selection of ...
Vida Jesenšek
doaj +1 more source
How Well Can Words Capture Facial Appearance? A Cross‐Linguistic Exploration
Topics in Cognitive Science, EarlyView.Abstract When describing faces, people often struggle with verbalizing facial features. Free descriptions seem to focus predominantly on aspects of faces that are inferred, for example, psychological traits, age, attractiveness, and so on, whereas facial features themselves are often described in a limited and imprecise fashion.
Ewelina Wnuk, Jan Wodowski
wiley +1 more source
On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph
Journal of Combinatorial Designs, Volume 34, Issue 8, Page 388-409, August 2026.ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n is a set of Hamiltonian cycles in which each 1‐path of K n appears exactly once. A Dudeney set of K n is a set of Hamiltonian cycles in which each 2‐path of K n appears exactly once. Kotzig's perfect set of HCDs of K n is a set of HCDs whose union forms a Dudeney set.
Nobuaki Mutoh
wiley +1 more source