Results 61 to 70 of about 26,105 (190)
A Lexicographic Product Cancellation Property for Digraphs [PDF]
There are four prominent product graphs in graph theory: Cartesian, strong, direct, and lexicographic. Of these four product graphs, the lexicographic product graph is the least studied.
Manion, Kendall
core +1 more source
Sequential properties of lexicographic products
In what follows, \(X\) denotes a Tychonoff (i.e., completely regular, Hausdorff) topological space. Let \(C(X)\) be the ring of all real valued continuous functions defined on \(X\). Each \(f \in C(X)\) defines a \textit{zeroset} of the form \(Z(f) = \{x \in X: f(x) = 0\}\). The complement of a zeroset is a \textit{cozeroset}.
Azarpanah, F., Etebar, M.
openaire +1 more source
Anselm's Temporal‐Ontological Proof
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
Geodetic numbers of tensor product and lexicographic product of graphs
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
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
WE, ELF and ELT: Perspectives on English and applied linguistics
Abstract In a paper which originally set the scene for WE study, Braj Kachu argued that the ‘global diffusion of English’ called for a new paradigm of enquiry which recognized the independent status of varieties of English used by communities other than those of Inner Circle native speakers.
Henry Widdowson
wiley +1 more source
Sharp Upper Bounds for Generalized Edge-Connectivity of Product Graphs
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
Abstract This paper presents a two‐stage model for planning a renewable energy portfolio by balancing economic, social and environmental sustainability goals. The first stage addresses a multi‐objective problem where conflictive impacts generated by the energy portfolios should be optimised according to the corresponding economic, social or ...
Amelia Bilbao‐Terol +2 more
wiley +1 more source
Utilizing lexicographic max product of picture fuzzy graph in human trafficking
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
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

