278 hasil
Menampilkan 1–20 · 0,17 detik · RSS
Transactions on Combinatorics
Scopus
ISSN 2251-8657 · University of Isfahan · 278 artikel di indeks
-
Artikel Jurnal Teks lengkap
Minimal graphs with respect to the multiplicative version of some vertex-degree-based topological indices
As a real-valued function, a graphical parameter is defined on the class of finite simple graphs, and remains invariant under graph isomorphism. In mathematical chemistry, vertex-degree-based topological indices are the graph parameters of the general form of $p_{\phi}(G)=\sum_{uv\in…
-
Artikel Jurnal Teks lengkap
The orders of subgroup products and coset products
A sect is a subset of a group given by the product of a finite number of subgroups. It is generally not a direct product nor even a subgroup of the group. For finite groups, the orders of sects are their basic invariants. In this paper we describe properties of the orders of sects, such as…
-
Artikel Jurnal Teks lengkap
Star-critical connected Ramsey numbers for 2-colorings of complete graphs
This paper builds upon Sumner's work by further investigating the concept of connected Ramsey numbers, specifically focusing on star-critical connected Ramsey numbers. We obtain star-critical connected Ramsey numbers for several cases of trees versus complete graphs, stars versus stars, and paths…
-
Artikel Jurnal Teks lengkap
A remark on sequentially Cohen-Macaulay monomial ideals
Let $R=K[x_1,\ldots,x_n]$ be the polynomial ring in $n$ variables over a field $K$. We show that if $G$ is a connected graph with a basic $5$-cycle $C$, then $G$ is a sequentially Cohen-Macaulay graph if and only if there exists a shedding vertex $x$ of $C$ such that $G\setminus x$ and $G\setminus…
-
Artikel Jurnal Teks lengkap
On the indices of certain graph products
Molecular descriptors are numerical graph invariants that are used to study the chemical structure of molecules. In this paper, we determine the upper bound of the Sombor index based on four operations involving the subdivision graph, semi-total point graph, semi-total line graph, and total graph…
-
Artikel Jurnal Teks lengkap
$G$-designs for the connected triangular bicyclic graphs with nine edges
A $G$-design of order $n$ is a decomposition of the complete graph $K_n$ into isomorphic copies of $G$. We show that if $G$ is a connected bicyclic graph with nine edges containing two triangles, a $G$-design of order $n$ exists whenever $n \equiv 0,1 \pmod{18}$.
-
Artikel Jurnal Teks lengkap
Some results on $\lambda$-design conjecture
Let $v$ and $\lambda$ be integers with $0r^*)$ are replication numbers of $D$ and for distinct points $x$ and $y$ of $D$, let $\lambda(x,y)$ denote the number of blocks of $X$ containing $x$ and $y$. In this paper we investigate the possibilities of $\lambda$-designs to be of type-1 under the…
-
Artikel Jurnal Teks lengkap
Cayley hypergraph over polygroups
Comer introduced a class of hypergroups, using the name of polygroups. He emphasized the importance of polygroups, by analyzing them in connections to graphs, relations, Boolean and cylindric algebras. Indeed, polygroups are multi valued systems that satisfy group like axioms. Given a polygroup…
-
Artikel Jurnal Teks lengkap
On relationship between reformulated Sombor and other vertex--degree indices
Let $G=(V,E)$, $V=\{v_1, v_2,\ldots,v_n\}$, $E=\{e_1, e_2,\ldots,e_m\}$, be a simple connected graph with $n\ge 2$ vertices and $m$ edges, with vertex degree sequence $\Delta=d_1\ge d_2\ge \cdots \ge d_n=\delta$, $ d_i=d(v_i)$, and edge degree sequence $\Delta_e=d(e_1)\ge d(e_2)\ge \cdots \ge…
-
Artikel Jurnal Teks lengkap
The degree-associated reconstruction number of an unicentroidal tree
As we know, by deleting one vertex of a graph $G$, we have a subgraph of $G$ called a card of $G$. Also, investigation of that each graph with at least three vertices is determined by its multiset of cards, is called the reconstruction conjecture and the minimum number of dacards that determine $G$…
-
Artikel Jurnal Teks lengkap
Induced Geodetic Sequence of a Graph
A vertex subset $S$ of a graph $G=(V,E)$ is said to be a geodetic set if every vertex in $G$ is in some $u-v$ geodesic for any $u,v \in S$. The minimum cardinality of such a set is the geodetic number, which is denoted as $g(G)$. In this paper, we introduce the concepts of induced geodetic number…
-
Artikel Jurnal Teks lengkap
On metric dimension of edge comb product of vertex-transitive graphs
Suppose finite graph $G$ is simple, undirected and connected. If $W$ is an ordered set of the vertices such that $|W| = k$, the representation of a vertex $v$ is an ordered $k$-tuple consisting distances of vertex $v$ with every vertices in $W$. The set $W$ is defined as resolving vertex of $G$ if…
-
Artikel Jurnal Teks lengkap
On the inverse mostar index problem for molecular graphs
Mostar indices are recently proposed distance-based graph invariants, that already have been much investigated and found applications. In this paper, we investigate the inverse problem for Mostar indices of unicyclic and bicyclic molecular graphs. We prove that all positive integers other than 1…
-
Artikel Jurnal Teks lengkap
On twin EP numbers
EP numbers were introduced by Estrada and Pogliani in 2008. These are positive integers $E(n)$ defined as the product of $n$ and the sum of the digits of $n$. Estrada and Pogliani suspected that there may be infinitely many twin EP numbers; i.e. those pairs in this sequence that differ by one. It…
-
Artikel Jurnal Teks lengkap
Three new classes of binomial Fibonacci sums
In this paper, we introduce three new classes of binomial sums involving Fibonacci (Lucas) numbers and weighted binomial coefficients. One particular result is linked to a problem proposal recently published in the journal The Fibonacci Quarterly.
-
Artikel Jurnal Teks lengkap
Line graphs of directed graphs I
We determine the forbidden induced subgraphs for the intersection of the classes of chordal bipartite graphs and line graphs of acyclic directed graphs. This is a first step towards finding the forbidden induced subgraphs for the class of line graphs of directed graphs.
-
Artikel Jurnal Teks lengkap
Some properties of the generalized sierpiński gasket graphs
The generalized Sierpiński gasket graphs $S[G,t]$ are introduced as the graphs obtained from the Sierpiński graphs $S(G,t)$ by contracting single edges between copies of previous phases. The family $S[G,t]$ is a generalization of a previously studied class of generalized Sierpiński gasket graphs…
-
Artikel Jurnal Teks lengkap
Commutative rings introduce a class of identifiable graphs
Let $R$ be a commutative ring with identity, and $ \mathrm{A}(R) $ be the set of ideals with non-zero annihilator. The annihilating-ideal graph of $ R $ is defined as the graph $AG(R)$ with the vertex set $ \mathrm{A}(R)^{*}=\mathrm{A}(R)\setminus\lbrace 0\rbrace $ and two distinct vertices $ I $…
-
Artikel Jurnal Teks lengkap
Density-Based clustering in mapReduce with guarantees on parallel time, space, and solution quality
A well-known clustering problem called Density-Based Spatial Clustering of Applications with Noise~(DBSCAN) involves computing the solutions of at least one disk range query per input point, computing the connected components of a graph, and bichromatic fixed-radius nearest neighbor. MapReduce…
-
Artikel Jurnal Teks lengkap
Forbidden subgraphs of Co-prime graphs of finite groups
For a finite group $G$ the co-prime graph $\Gamma(G)$ is defined as a graph with vertex set $G$ in which two distinct vertices $x$ and $y$ are adjacent if and only if $gcd(o(x),o(y))=1$ where $o(x)$ and $o(y)$ denote the orders of the elements $x$ and $y$ respectively. In this paper we find…