Results 11 to 20 of about 3,066,756 (267)
On the enumeration of uniquely reducible double designs [PDF]
A double $2$-$(v,k,2 \lambda)$ design is a design which is reducible into two $2$-$(v,k,\lambda)$ designs. It is called uniquely reducible if it has, up to equivalence, only one reduction.
Veerle Fack+2 more
doaj +1 more source
Odd Harmonious Labeling of Pn ⊵ C4 and Pn ⊵ D2(C4)
A graph G with q edges is said to be odd harmonious if there exists an injection f:V(G) → ℤ2q so that the induced function f*:E(G)→ {1,3,...,2q-1} defined by f*(uv)=f(u)+f(v) is a bijection.Here we show that graphs constructed by edge comb product of ...
Sabrina Shena Sarasvati+2 more
doaj +1 more source
Constructing new graph from the graph's parameters and related notions in the way that, the study on the new graph and old graph in their parameters could be facilitated. As graph, new graph has some characteristics and results which are related to the structure of this graph.
openaire +2 more sources
Emerging infectious diseases are a growing threat in sub-Saharan African countries, but the human and technical capacity to quickly respond to outbreaks remains limited.
Sara Botero-Mesa+47 more
doaj +1 more source
COVID-19 in Switzerland real-time epidemiological analyses powered by EpiGraphHub
Here we present the design and results of an analytical pipeline for COVID-19 data for Switzerland. It is applied to openly available data from the beginning of the epidemic in 2020 to the present day (august 2022).
Flávio Codeço Coelho+2 more
doaj +1 more source
Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference orders), when consolidating conflicting views regarding ...
Endriss, Ulle, Grandi, Umberto
openaire +11 more sources
A smart contract is code deployed in a blockchain environment, or the source code from which such code was compiled.
Primavera De Filippi+2 more
doaj +1 more source
DIMENSI METRIK DARI GRAF HASIL IDENTIFIKASI
Pada paper ini dibahas mengenai dimensi metrik dari graf hasil identififikasi. Dimensi metrik dari sebuah graf G, dinotasikan dengan dim(G), adalah kardinalitas paling kecil dari setiap himpunan pembeda di G.
Kristiana Wijaya
doaj +1 more source
Accurately predicting the binding affinity between proteins and ligands is crucial for drug discovery. Recent advances in graph neural networks (GNNs) have made significant progress in learning representations of protein-ligand complexes to estimate ...
Jianqiu Wu+3 more
doaj +1 more source
On the independence graph of a graph
AbstractVertices of the independence graph of a graph G represent maximum independent sets of G, two vertices being adjacent whenever the corresponding sets are disjoint. Vizing's inequality involving the independence number of the Cartesian product of graphs G and H states that α(G□H)⩽min{α(G)|V(H)|,α(H)|V(G)|}.
Bla Zmazek, Boštjan Brešar
openaire +1 more source