Results 1 to 10 of about 34,229 (120)
Detour Global Domination for Degree Splitting graphs of some graphs
Ratio Mathematica, 2023 In this paper, we introduced the new concept detour global domination number for degree splitting graph of standard graphs. The detour global dominating sets in some standard and special graphs are determined.
C. Jayasekaran, S.V. Ashwin Prakash
doaj +1 more source
Complexity of Some Duplicating Networks
IEEE Access, 2021 There are plentiful ways to duplicate a graph (network), such as splitting, shadow, mirror, and total graph. In this paper, we derive an evident formula of the complexity, a number of spanning trees, of the closed helm graph, the mirror graph of the path
Mohamed R. Zeen El Deen +1 more
doaj +1 more source
Albertson (Alb) spectral radii and Albertson (Alb) energies of graph operation
Frontiers in Chemistry, 2023 The sum of the absolute eigenvalues of the adjacency matrix make up graph energy. The greatest absolute eigenvalue of the adjacency matrix is represented by the spectral radius of the graph.
Muhammad Mobeen Munir, Urwah Tul Wusqa
doaj +1 more source
ABC energies and spectral radii of some graph operations
Frontiers in Physics, 2022 The present article presents some new results relating to Atomic Bond Connectivity energies and Spectral radii of generalized splitting and generalized shadow graphs constructed on the basis of some fundamental families of cycle graph Cn, complete graph ...
Ahmad Bilal, Muhammad Mobeen Munir
doaj +1 more source
Hypergraph cuts with edge-dependent vertex weights
Applied Network Science, 2022 We develop a framework for incorporating edge-dependent vertex weights (EDVWs) into the hypergraph minimum s-t cut problem. These weights are able to reflect different importance of vertices within a hyperedge, thus leading to better characterized cut ...
Yu Zhu, Santiago Segarra
doaj +1 more source
ISI spectral radii and ISI energies of graph operations
Frontiers in Physics, 2023 Graph energy is defined to be the p-norm of adjacency matrix associated to the graph for p = 1 elaborated as the sum of the absolute eigenvalues of adjacency matrix.
Ahmad Bilal +3 more
doaj +1 more source
Graphs of Edge-Intersecting Non-Splitting Paths in a Tree: Representations of Holes-Part II [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Given a tree and a set P of non-trivial simple paths on it, VPT(P) is the VPT graph (i.e. the vertex intersection graph) of the paths P, and EPT(P) is the EPT graph (i.e. the edge intersection graph) of P.
Arman Boyacı +3 more
doaj +1 more source
On equitable near-proper coloring of some derived graph classes
Karpatsʹkì Matematičnì Publìkacìï, 2022 An equitable near-proper coloring of a graph $G$ is a defective coloring in which the number of vertices in any two color classes differ by at most one and the bad edges obtained is minimized by restricting the number of color classes that can have ...
S. Jose, S. Naduvath
doaj +1 more source
AVD proper edge-coloring of some families of graphs
International Journal of Mathematics for Industry, 2021 Adjacent vertex-distinguishing proper edge-coloring is the minimum number of colors required for the proper edge-coloring of [Formula: see text] in which no two adjacent vertices are incident to edges colored with the same set of colors.
J. Naveen
doaj +1 more source
Single Valued Pentapartitioned Neutrosophic Graphs [PDF]
Neutrosophic Sets and Systems, 2022 The notion of single valued pentapartitioned neutrosophic set is the extension of single valued neutrosophic set and quadripartitioned single valued neutrosophic set.
Suman Das, Rakhal Das, Surapati Pramanik
doaj +1 more source