Results 41 to 50 of about 70 (68)

Properties of uniformly $3$-connected graphs [PDF]

Discrete Mathematics & Theoretical Computer Science
A 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

Non-commuting graph of the dihedral group determined by Hosoya parameters

Alexandria Engineering Journal, 2022
Hosoya introduced the concept of graph terminologies in chemistry and provide a modeling for molecules. This modeling leads to predict the chemical properties of molecules, easy classification of chemical compounds, computer simulations and computer ...
Muhammad Salman, Tahira Noreen, Masood Ur Rehman, Jinde Cao, Muhammad Zafar Abbas   +4 more
doaj  

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

On Nordhaus-Gaddum type relations of δ-complement graphs. [PDF]

Heliyon, 2023
Vichitkunakorn P, Maungchang R, Tangjai W.   +2 more
europepmc   +1 more source

Social network analysis by Turiyam graphs. [PDF]

BMC Res Notes, 2023
Ganati GA, Repalle VNSR, Ashebo MA.
europepmc   +1 more source

Several Zagreb indices of power graphs of finite non-abelian groups. [PDF]

Heliyon, 2023
Ismail R, Ali F, Qasim R, Naeem M, Mashwani WK, Khan S.   +5 more
europepmc   +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∈Sdeg⁡G(v)]dG(S),SDD_k (G)
Mao Yaping, Wang Zhao, Das Kinkar Ch.
doaj   +1 more source

On the first Zagreb index and multiplicative Zagreb coindices of graphs

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016
For a (molecular) graph G with vertex set V (G) and edge set E(G), the first Zagreb index of G is defined as , where dG(vi) is the degree of vertex vi in G. Recently Xu et al. introduced two graphical invariants and named as first multiplicative Zagreb
Das Kinkar Ch., Akgunes Nihat, Togan Muge, Yurttas Aysun, Cangul I. Naci, Cevik A. Sinan   +5 more
doaj   +1 more source

On the maximum atom-bond sum-connectivity index of graphs

Open Mathematics
The atom-bond sum-connectivity (ABS) index of a graph GG with edges e1,…,em{e}_{1},\ldots ,{e}_{m} is the sum of the numbers 1−2(dei+2)−1\sqrt{1-2{\left({d}_{{e}_{i}}+2)}^{-1}} over 1≤i≤m1\le i\le m, where dei{d}_{{e}_{i}} is the number of edges adjacent
Alraqad Tariq, Saber Hicham, Ali Akbar, Albalahi Abeer M.   +3 more
doaj   +1 more source

On the δ-chromatic numbers of the Cartesian products of graphs

Open Mathematics
In 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, Pho-on Witsarut, Vichitkunakorn Panupong   +2 more
doaj   +1 more source