Results 71 to 80 of about 279,078 (329)
On cyclic orthogonal double covers of circulant graphs by special infinite graphs
In this article, a technique to construct cyclic orthogonal double covers (CODCs) of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and is introduced.
R. El-Shanawany, A. El-Mesady
doaj +1 more source
Spectra of the extended neighborhood corona and extended corona of two graphs
In this paper we define extended corona and extended neighborhoodcorona of two graphs $G_{1}$ and $G_{2}$, which are denoted by$G_{1}\bullet G_{2}$ and $G_{1}\ast G_{2}$ respectively.
Chandrashekar Adiga +2 more
doaj +1 more source
Context-Sensitive Languages, Rational Graphs and Determinism [PDF]
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices.
Arnaud Carayol, Antoine Meyer
doaj +1 more source
Induction of diabetes in three different mouse strains uniformly resulted in an increase in TNAP activity and a reduction in pyrophosphate (PPi) in the circulation. Inhibition of TNAP restored plasma PPi. Diabetes‐induced calcification in the media layer of the aorta was detected only in the Abcc6−/− strain, which is predisposed to ectopic ...
Krisztina Fülöp +13 more
wiley +1 more source
An advance in infinite graph models for the analysis of transportation networks
This paper extends to infinite graphs the most general extremal issues, which are problems of determining the maximum number of edges of a graph not containing a given subgraph.
Cera Martín, Fedriani Eugenio M.
doaj +1 more source
Block circulant graphs and the graphs of critical pairs of crowns
In this paper, we provide a natural bijection between a special family of block circulant graphs and the graphs of critical pairs of the posets known as generalized crowns.
Rebecca E. Garcia +3 more
doaj +1 more source
Isoscattering strings of concatenating graphs and networks
We identify and investigate isoscattering strings of concatenating quantum graphs possessing n units and 2n infinite external leads. We give an insight into the principles of designing large graphs and networks for which the isoscattering properties are ...
Michał Ławniczak +3 more
doaj +1 more source
Infinite friendship graphs with infinite parameters
We study infinite graphs in which every set of \(\kappa\) vertices has exactly \(\lambda\) common neighbours. We prove that there exist \(2^{\sigma}\) such graphs of each infinite order \(\sigma\) if \(\kappa\) is finite and that for \(\kappa\) infinite there are \(2^{\lambda}\) of them of order \(\lambda\) and none of cardinality greater than ...
Hahn, Geňa +2 more
openaire +2 more sources
Degree Sequences of Infinite Graphs [PDF]
Peer Reviewed ; http://deepblue.lib.umich.edu/bitstream/2027.42/135582/1/jlms0010 ...
Blass, Andreas, Harary, Frank
openaire +2 more sources
The rigidity of infinite graphs [PDF]
A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and ...
Kitson, D., Power, S. C.
core

