Results 1 to 10 of about 445 (76)
On the existence of tripartite graphs and n-partite graphs
Open MathematicsA sequence α\alpha of nonnegative integers is said to be graphic if it is the degree sequence of a simple graph GG, and such a graph GG is called a realization of α\alpha .
Guo Jiyun +4 more
doaj +1 more source
Properties of uniformly $3$-connected graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA graph on at least ${{k+1}}$ vertices is uniformly $k$-connected if each pair of its vertices is connected by $k$ and not more than $k$ independent paths.
Frank Göring, Tobias Hofmann
doaj +1 more source
ALTERNATING AND SYMMETRIC GROUPS WITH EULERIAN GENERATING GRAPH
Forum of Mathematics, Sigma, 2017 Given a finite group $G$ , the generating graph $\unicode[STIX]{x1D6E4}(G)$
ANDREA LUCCHINI, CLAUDE MARION
doaj +1 more source
An extremal problem on potentially $K_{m}-P_{k}$-graphic sequences
, 2005 A sequence $S$ is potentially $K_{m}-P_{k}$ graphical if it has a realization containing a $K_{m}-P_{k}$ as a subgraph. Let $\sigma(K_{m}-P_{k}, n)$ denote the smallest degree sum such that every $n$-term graphical sequence $S$ with $\sigma(S)\geq \sigma(
Lai, Chunhui
core +1 more source
Complete graphs: the space of simplicial cones, and their path tree representation
, 2017 Let $G$ be a complete graph with $n+1$ vertices. In a recent paper of the authors, it is shown that the path trees of the graph play a special role in the structure of the truncated powers and partition functions that are associated with the graph ...
Ron, Amos, Shengnan, Wang
core
On the δ-chromatic numbers of the Cartesian products of graphs
Open MathematicsIn this work, we study the δ\delta -chromatic number of a graph, which is the chromatic number of the δ\delta -complement of a graph. We give a structure of the δ\delta -complements and sharp bounds on the δ\delta -chromatic numbers of the Cartesian ...
Tangjai Wipawee +2 more
doaj +1 more source
On Nordhaus-Gaddum type relations of δ-complement graphs. [PDF]
Heliyon, 2023 Vichitkunakorn P +2 more
europepmc +1 more source
Random independent sets in triangle-free graphs
Forum of Mathematics, SigmaWe establish several new results on the existence of probability distributions on the independent sets in triangle-free graphs where each vertex is present with a given probability.
Anders Martinsson, Raphael Steiner
doaj +1 more source
Steiner Degree Distance of Two Graph Products
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019 The degree distance DD(G) of a connected graph G was invented by Dobrynin and Kochetova in 1994. Recently, one of the present authors introduced the concept of k-center Steiner degree distance defined as SDDk(G)=∑S⊆V(G)|S|=k[∑v∈SdegG(v)]dG(S),SDD_k (G)
Mao Yaping, Wang Zhao, Das Kinkar Ch.
doaj +1 more source
Social network analysis by Turiyam graphs. [PDF]
BMC Res Notes, 2023 Ganati GA, Repalle VNSR, Ashebo MA.
europepmc +1 more source