Results 11 to 20 of about 316,679 (279)
Examples and Counterexamples, 2023 A new strongly regular graph with parameters (81,30,9,12) is found as a graph invariant under certain subgroup of the full automorphism group of the previously known strongly regular graph discovered in 1981 by J. H. van Lint and A. Schrijver.
Dean Crnković, Andrea Švob
doaj +1 more source
Stanley Depth of the Edge Ideal of Extended Gear Networks and Application in Circuit Analysis
Journal of Mathematics, 2022 Graph theory is widely used in power network analysis, complex network, and engineering calculation. Stanley depth is a geometric invariant of the module which is closely related to an algebraic invariant called depth of the module.
Guiling Zeng +4 more
doaj +1 more source
Total Domination in Generalized Prisms and a New Domination Invariant
Discussiones Mathematicae Graph Theory, 2021 In this paper we complement recent studies on the total domination of prisms by considering generalized prisms, i.e., Cartesian products of an arbitrary graph and a complete graph.
Tepeh Aleksandra
doaj +1 more source
On Transmission Irregular Cubic Graphs of an Arbitrary Order
Mathematics, 2022 The transmission of a vertex v of a graph G is the sum of distances from v to all the other vertices of G. A transmission irregular graph (TI graph) has mutually distinct vertex transmissions.
Anatoly Yu. Bezhaev, Andrey A. Dobrynin
doaj +1 more source
Homological invariants of Cameron–Walker Graphs [PDF]
Transactions of the American Mathematical Society, 2021 Let G G be a finite simple connected graph on [ n ] [n] and \[ R = K [ x 1 , … , x n ] R = K[x_1, \ldots , x_n] \] the polynomial ring in n n ...
Hibi, Takayuki +4 more
openaire +2 more sources
Best Graph Type to Compare Discrete Groups: Bar, Dot, and Tally
Frontiers in Psychology, 2021 Different graph types might differ in group comparison due to differences in underlying graph schemas. Thus, this study examined whether graph schemas are based on perceptual features (i.e., each graph has a specific schema) or common invariant ...
Fang Zhao, Robert Gaschler
doaj +1 more source
Some Invariants of Flower Graph [PDF]
Applied Mathematics and Nonlinear Sciences, 2018 Abstract Let G be a graph and let mij (G), i, j ≥ 1, represents the number of edge of G, where i and j are the degrees of vertices u and v respectively. In this article, we will compute different polynomials of flower graph f( n×m ), namely M polynomial and Forgotten polynomial ...
Virk, Abaid ur Rehman, Quraish, Muhammad
openaire +2 more sources
Some Invariants of Jahangir Graphs [PDF]
Symmetry, 2017 In this report, we compute closed forms of M-polynomial, first and second Zagreb polynomials and forgotten polynomial for Jahangir graphs Jn,m for all values of m and n. From the M-polynomial, we recover many degree-based topological indices such as first and second Zagreb indices, modified Zagreb index, Symmetric division index, etc.
Mobeen Munir +5 more
openaire +1 more source
Some Applications of Strong Product [PDF]
Mathematics Interdisciplinary Research, 2018 Let G and H be graphs. The strong product GH of graphs G and H is the graph with vertex set V(G)V(H) and u=(u1, v1) is adjacent with v= (u2, v2) whenever (v1 = v2 and u1 is adjacent with u2) or (u1 = u2 and v1 is adjacent with v2) or (u1 is adjacent ...
Mostafa Tavakoli +2 more
doaj +1 more source
Diameter-invariant graphs [PDF]
Mathematica Bohemica, 2005 Summary: The diameter of a graph \(G\) is the maximal distance between two vertices of~\(G\). A graph \(G\) is said to be diameter-edge-invariant, if \(d(G-e)=d(G)\) for all its edges, diameter-vertex-invariant, if \(d(G-v)=d(G)\) for all its vertices and diameter-adding-invariant if \(d(G+e)=d(e)\) for all edges of the complement of the edge set of ...
openaire +1 more source