Results 91 to 100 of about 26,105 (190)

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

Transactions 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  

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

Indonesian 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

Super connectivity of lexicographic product graphs

, 2020
For a graph $G$, $k(G)$ denotes its connectivity. A graph is super connected if every minimum vertex-cut isolates a vertex. Also $k_{1}$-connectivity of a connected graph is the minimum number of vertices whose deletion gives a disconnected graph without isolated vertices.
Kamyab, Khalid, Ghasemi, Mohsen, Varmazyar, Rezvan   +2 more
openaire   +2 more sources

Cardinal functions on lexicographic products

Topology and its Applications
The authors consider lexicographic products of GO-spaces.
Hirata, Yasushi, Kemoto, Nobuyuki
openaire   +2 more sources

The Tshivenḓa-English Ṱahalusamaipfi/Dictionary as a Product of South African Lexicographic Processes

Lexikos, 2011
<p>ABSTRACT: The publication of a dictionary is regarded as the result of a lexicographic process. Three subtypes of a lexicographic process have been noted, namely the primary comprehensive, the secondary comprehensive and the dictionary specific ...
Mbulungeni Madiba, Dion Nkomo
doaj   +1 more source

Bounds for DNA codes with constant GC-content

, 2003
We derive theoretical upper and lower bounds on the maximum size of DNA codes of length n with constant GC-content w and minimum Hamming distance d, both with and without the additional constraint that the minimum Hamming distance between any codeword ...
King, Oliver D.
core   +3 more sources

A lexicographic product for signed graphs

, 2019
Summary: A signed graph is a pair \(\Gamma=(G,\sigma)\), where \(G=(V(G),E(G))\) is a graph and \(\sigma:E(G)\rightarrow\{+1,-1\}\) is the sign function on the edges of \(G\). The notion of composition (also known as lexicographic product) of two signed graphs \(\Gamma\) and \(\Lambda=(H,\tau)\) already exists in literature, yet it fails to map ...
Brunetti M, Cavaleri M, Donno A.
openaire   +2 more sources

Closed Formulae for the Strong Metric Dimension of Lexicographic Product Graphs

Discussiones Mathematicae Graph Theory, 2016
Given a connected graph G, a vertex w ∈ V (G) strongly resolves two vertices u, v ∈ V (G) if there exists some shortest u − w path containing v or some shortest v − w path containing u. A set S of vertices is a strong metric generator for G if every pair
Kuziak Dorota, Yero Ismael G., Rodríguez-Velázquez Juan A.   +2 more
doaj   +1 more source

School Milk Consumption in Germany - What are Important Product Attributes for Children and Parents? [PDF]

Food Consumption/Nutrition/Food Safety,
Christoph, Inken B., Peter, Guenter, Rothe, Andrea, Salamon, Petra, Weber, Sascha A., Weible, Daniela   +5 more
core   +1 more source

Hamiltonian Decomposition of Lexicographic Products of Digraphs

Journal 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