Results 91 to 100 of about 1,343 (197)

Four‐Dimensional pp‐Wave Lie Groups and Harmonic Curvature

open access: yesMathematische Nachrichten, Volume 299, Issue 7, Page 1751-1780, July 2026.
ABSTRACT We determine all four‐dimensional Lie groups which have harmonic curvature. In parallel, a description of four‐dimensional pp‐wave Lie groups is obtained.
E. García‐Río   +2 more
wiley   +1 more source

Notions of Rough Neutrosophic Digraphs

open access: yesMathematics, 2018
[-3]Graph theory has numerous applications in various disciplines, including computer networks, neural networks, expert systems, cluster analysis, and image capturing. Rough neutrosophic set (NS) theory is a hybrid tool for handling uncertain information
Nabeela Ishfaq   +3 more
doaj   +1 more source

Skew-spectra and skew energy of various products of graphs [PDF]

open access: yesTransactions on Combinatorics, 2015
Given a graph $G$, let $G^sigma$ be an oriented graph of $G$ with the orientation $sigma$ and skew-adjacency matrix $S(G^sigma)$. Then the spectrum of $S(G^sigma)$ consisting of all the eigenvalues of $S(G^sigma)$ is called the skew-spectrum of $G ...
Xueliang Li, Huishu Lian
doaj  

A new upper bound of the basis number of the lexicographic product of graphs [PDF]

open access: yes, 2010
An upper bound of the basis number of the lexicographic product of two graphs from the basis number of the factors is presented.
Jaradat, M.M.M.
core  

Some cardinal functions in lexicographic products of LOTS [PDF]

open access: yes, 2017
The Lindel\"{o}f degree and extent were studied in \cite{BCW} in relation to lexicographic products of linearly ordered spaces. In this paper we consider the behaviour of other important cardinal functions in such lexicographic products.
Chetcuti, Emmanuel   +5 more
core   +1 more source

Edge magic total labeling of lexicographic product C4(2r+1) o ~K2 cycle with chords, unions of paths, and unions of cycles and paths

open access: yesIndonesian Journal of Combinatorics, 2018
An edge magic total (EMT) labeling of a graph G = (V, E) is a bijection from the set of vertices and edges to a set of numbers defined by λ : V ∪ E → {1, 2, ..., ∣V∣ + ∣E∣} with the property that for every xy ∈ E, the weight of xy equals to a constant k,
Inne Singgih
doaj   +1 more source

Hamiltonian Decomposition of Lexicographic Products of Digraphs

open access: yesJournal of Combinatorial Theory, Series B, 1998
We partially resolve a conjecture of Alspach, Bermond, and Sotteau by showing that the lexicographic product of two hamiltonian decomposable digraphs, the first of odd order, is itself hamiltonian decomposable in general.
openaire   +1 more source

The lexicographic preference for a son: evidence from household data in Vietnam [PDF]

open access: yes
This paper examines son preferences by specifying sex composition by birth order of existing children as key independent variables. The results indicate a lexicographic preference for a son by mothers aged 50 years and older.
Tien Manh Vu
core  

Minimum cycle bases of lexicographic products

open access: yesArs Mathematica Contemporanea, 2012
Minimum cycle bases of product graphs can in most situations be constructed from minimum cycle bases of the factors together with a suitable collection of triangles and/or quadrangles determined by the product operation. Here we give an explicit construction for the lexicographic product G o H that generalizes results by Berger and Jaradat to the case ...
Hellmuth, Marc   +2 more
openaire   +3 more sources

Infinite lexicographic products of positional objectives

open access: yesCoRR
This paper contributes to the study of positional determinacy of infinite duration games played on potentially infinite graphs with neutral transitions. Recently, [Ohlmann, TheoretiCS 2023] established that positionality of prefix-independent objectives is preserved by finite lexicographic products.
Antonio Casares   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy