Results 81 to 90 of about 5,793,190 (230)

Scalable Computation of Topological Abstractions for Scalar Data

open access: yesComputer 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

Geodetic numbers of tensor product and lexicographic product of graphs

open access: yesAKCE International Journal of Graphs and Combinatorics
A shortest [Formula: see text]-[Formula: see text] path between two vertices u and v of a graph G is a [Formula: see text]-[Formula: see text] geodesic of G.
K. Raja Chandrasekar
doaj   +1 more source

L(2, 1)-coloring and irreducible no-hole coloring of lexicographic product of graphs

open access: yesAKCE 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

Anselm's Temporal‐Ontological Proof

open access: yesNoû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

Sharp Upper Bounds for Generalized Edge-Connectivity of Product Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2016
The generalized k-connectivity κk(G) of a graph G was introduced by Hager in 1985. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized k-edge-connectivity which is defined as λk(G) = min{λ(S) : S ⊆ V (G) and |
Sun Yuefang
doaj   +1 more source

‘Chrystalline Talk’: Thomas Browne's Poetics of Concretion and Mineral Plain Style

open access: yesRenaissance 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

Utilizing lexicographic max product of picture fuzzy graph in human trafficking

open access: yesAin Shams Engineering Journal
Graph structures are an essential tool for solving combinatorial problems in computer science and computational intelligence. With an emphasis on signed graphs, picture-fuzzy graphs, and graphs with colored or labeled edges, this study explores the ...
Peide Liu   +4 more
doaj   +1 more source

Operations on Intuitionistic Fuzzy Graph Structures

open access: yesFuzzy 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

On the products of group vertex magic graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2022
Let [Formula: see text] be a simple undirected graph and let A be an additive Abelian group with identity 0. A mapping [Formula: see text] is said to be a A-vertex magic labeling of G if there exists a μ in A such that [Formula: see text] for any vertex ...
S. Balamoorthy   +2 more
doaj   +1 more source

How Well Can Words Capture Facial Appearance? A Cross‐Linguistic Exploration

open access: yesTopics 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

Home - About - Disclaimer - Privacy