Results 41 to 50 of about 3,368,549 (267)
On the strong beta-number of galaxies with three and four components
The beta-number of a graph is the smallest positive integer for which there exists an injective function such that each is labeled and the resulting set of edge labels is for some positive integer . The beta-number of is if there exists no such integer .
Rikio Ichishima +2 more
doaj +1 more source
ABSTRACT Secondary hyperparathyroidism (SHPT) is a common complication in patients receiving maintenance dialysis, driven by calcium and phosphate metabolism disturbances. Calcimimetics are central to the management of SHPT by enhancing calcium‐sensing receptor sensitivity and reducing parathyroid hormone secretion.
Fumihiko Koiwa +3 more
wiley +1 more source
Let be a graph of order . A numbering of is a labeling that assigns distinct elements of the set to the vertices of , where each edge of is labeled .
Rikio Ichishima +2 more
doaj +1 more source
Integration and measures on the space of countable labelled graphs [PDF]
In this paper we develop a rigorous foundation for the study of integration and measures on the space $\mathscr{G}(V)$ of all graphs defined on a countable labelled vertex set $V$.
Khare, Apoorva, Rajaratnam, Bala
core
Learning Graph Embedding with Adversarial Training Methods
Graph embedding aims to transfer a graph into vectors to facilitate subsequent graph analytics tasks like link prediction and graph clustering. Most approaches on graph embedding focus on preserving the graph structure or minimizing the reconstruction ...
Fung, Sai-fu +5 more
core +1 more source
Dietary Protein Intake and Peritoneal Protein Losses in Peritoneal Dialysis Patients
ABSTRACT Introduction Peritoneal dialysis (PD) patients lose protein in their waste dialysate, potentially increasing their risk for malnutrition. We wished to determine whether there was any association between losses and dietary protein intake (DPI). Methods DPI was assessed from 24‐h dietary recall using Nutrics software.
Haalah Shaaker, Andrew Davenport
wiley +1 more source
The consecutively super edge-magic deficiency of graphs and related concepts
A bipartite graph G with partite sets X and Y is called consecutively super edge-magic if there exists a bijective function f : V(G) ⋃ E(G) → {1,2,...,|V(G)| + |E(G)|} with the property that f(X) = {1,2,...,|X|}, f(Y) = {|X|+1, |X|+2,...,|V(G)|} and f(u)+
Rikio Ichishima +2 more
doaj +1 more source
On sub-class sizes of mutually permutable products
In this paper, we investigate the influence of sub-class sizes on a mutually permutable factorized group in which the sub-class sizes of some elements of its factors have certain quantitative properties. Some criteria for a group to be pp-nilpotent or pp-
Li Jinbao, Yang Yong
doaj +1 more source
Graph properties of graph associahedra [PDF]
A graph associahedron is a simple polytope whose face lattice encodes the nested structure of the connected subgraphs of a given graph. In this paper, we study certain graph properties of the 1-skeleta of graph associahedra, such as their diameter and ...
Manneville, Thibault, Pilaud, Vincent
core +1 more source
Autoregressive Moving Average Graph Filtering
One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem.
Isufi, Elvin +3 more
core +1 more source

