Search Results/Filters    

Filters

Year

Banks


Expert Group


Full-Text


Author(s): 

Hardany Elham | Behtoei Ali

Issue Info: 
  • Year: 

    2025
  • Volume: 

    14
  • Issue: 

    1
  • Pages: 

    369-386
Measures: 
  • Citations: 

    0
  • Views: 

    12
  • Downloads: 

    0
Abstract: 

‎Since the problem of computing the adjacency dimension of a graph is NP-hard‎, ‎finding the adjacency dimension of special classes of graphs or obtaining good bounds on this invariant is valuable‎. ‎In this paper we determine the properties of each adjacency resolving set of paths. ‎Then, ‎by ‎using ‎these ‎properties,‎ we determine the adjacency dimension of broom and double broom graphs‎.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 12

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Author(s): 

Hamidi Mohammad

Issue Info: 
  • Year: 

    2024
  • Volume: 

    13
  • Issue: 

    3
  • Pages: 

    287-304
Measures: 
  • Citations: 

    0
  • Views: 

    17
  • Downloads: 

    1
Abstract: 

A hypertree is a special type of connected hypergraph that removes‎ ‎any‎, ‎its hyperedge then results in a disconnected hypergraph‎. ‎Relation between hypertrees (hypergraphs) and trees (graphs) can be helpful to solve real problems in hypernetworks and networks and it is the main tool in this regard‎. ‎The purpose of this paper is to introduce a positive relation (as $\alpha$-relation) on hypertrees that makes a connection between hypertrees and trees‎. ‎This relation is dependent on some parameters such as path‎, ‎length of a path‎, ‎and the intersection of hyperedges‎. ‎For any $q\in \mathbb{N}‎, ‎$ we introduce the concepts of a derivable tree‎, ‎$(\alpha‎, ‎q)$-hypergraph‎, ‎and fundamental $(\alpha‎, ‎q)$-hypertree for the first time in this study and analyze the structures of derivable trees from hypertrees via given positive relation‎. ‎In the final‎, ‎we apply the notions of derivable trees‎, ‎$(\alpha‎, ‎q)$-trees in real optimization problems by modeling hypernetworks and networks based on hypertrees and trees‎, ‎respectively.‎‎‎

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 17

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 1 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2022
  • Volume: 

    11
  • Issue: 

    1
  • Pages: 

    45-51
Measures: 
  • Citations: 

    0
  • Views: 

    33
  • Downloads: 

    3
Abstract: 

The energy of a graph is the sum of the absolute values of the eigenvalues of a graph‎. ‎Two graphs are said to be equienergetic if they have same energy‎. ‎A graph is said to be complementary equienergetic if it is equienergetic with its complement‎. ‎Recently several complementary equienergetic graphs have been identified‎. ‎In this paper‎, ‎we characterize the cycles‎, ‎paths‎, ‎complete bipartite regular graphs and iterated line graphs of regular graphs‎, ‎which are complementary equienergetic‎..

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 33

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 3 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Author(s): 

Farahmand Rad Shahriar

Issue Info: 
  • Year: 

    2022
  • Volume: 

    11
  • Issue: 

    1
  • Pages: 

    15-27
Measures: 
  • Citations: 

    0
  • Views: 

    21
  • Downloads: 

    4
Abstract: 

The deterministic permutation flow shop scheduling problem with makespan criterion is not solvable in polynomial time‎. ‎Therefore‎, ‎researchers have thought about heuristic algorithms‎. ‎There are many heuristic algorithms for solving it that is a very important combinatorial optimization problem‎. ‎In this paper‎, ‎a new algorithm is proposed for solving the mentioned problem‎. ‎The presented algorithm chooses the weighted path that starts from the up-left corner and reaches the down-right in the matrix of jobs processing times and calculates the biggest sum of the times in the footprints of this path‎. ‎The row with the biggest sum permutes among all the rows of the matrix for locating the minimum of makespan‎. ‎This method was run on Taillard’s standard benchmark and the solutions were compared with the optimum or the best ones as well as 14 famous heuristics‎. ‎The validity and effectiveness of the algorithm are shown with tables and statistical evaluation‎.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 21

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 4 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
Issue Info: 
  • Year: 

    2023
  • Volume: 

    9
  • Issue: 

    1
  • Pages: 

    55-71
Measures: 
  • Citations: 

    0
  • Views: 

    39
  • Downloads: 

    0
Abstract: 

Algebraic structures on topological spaces can’t distinguish all the non-homeomorphic spaces. Recently, by equipping some of these algebraic structures with topology, one can separate the non-homeomorphic spaces with the same algebraic structures. Particularly, the fundamental group is equipped by the various types of topologies which some of them make it a topological group and some of them don't‎. Virk‎ ‎and‎ ‎Zastro‎w has‎ ‎studied‎ ‎the‎ ‎generalizations‎ ‎of‎ ‎the‎ ‎existing‎‎‎ ‎topologies‎ ‎on‎ ‎the‎ ‎fundamental‎‎group‎ ‎to‎ ‎the‎ ‎universal‎ ‎Path‎ ‎space‎ with a proper comparison. If we remove the condition α(0) = x0  from the definition of the universal path space,  we obtain an object that have been discussed in mathematical literatures under the name  “ fundamental groupoid”. Indeed, fundamental groupoid denoted by πX , is the category of homotopy classes of paths in X  as the morphisms and has the set X  as the objects set. For any x , y  ∈X , the set πXx,y  is the set of homotopy classes of paths in X  from x  to y . We can consider the object group at x , πXx , as the well-known fundamental group π1X,x.  ‎ ‎ In order to answer the question how these topologies can be generalized on the fundamental groupoids, the authors has introduced the Lasso topology on the fundamental groupoid of a locally path connected space in which makes it a topological groupoid. A topological groupoid is a groupoid G  together with topologies on G  and G0  such that the structure maps are continuous‎.  R‎. ‎Brown and G‎. ‎Danesh-Naruie were the first and only ones to take this step‎. ‎They have defined a topology on a quotient of the fundamental groupoid such that it became a topological groupoid when the given space X  is locally path connected and semilocally simply connected. Here, we introduce whisker topology on the fundamental groupoid of a locally path connected space X  in which it’s basis is known and by some assumptions, we can consider it as a generalization of the whisker topology on the fundamental group. Material and methods ‎‎ For a given topological space (X,τ) , let [α]∈πX(x,y) ‎, where x,y∈X . ‎If V , ‎ W  are open neighborhoods of x ‎, y, respectively‎, one can define Nα,V,W:=β∈πX β≃γ*α*λ, γI⊆V, λI⊆W} , where γ1=α0=x  and α1=λ0=y. Theorem: ‎The family‎ ‎Nα,V,W;α∈πXx,y,x∈V∈τ,y∈W∈τ ‎forms a basis for a topology on fundamental groupoid‎.  ‎The topology that is generated by this basis‎, ‎is called Whisker topology. Conclusion Based on the results that we presented in this paper: If X  is a small loop transfer space; The multiplication map m: πwhX × πwhX → πwhX is continuous. The fundamental groupoid with the Whisker topology is a topological groupoid. The inherited topology from fundamental groupoid πwhX  on the object group πwhX(x)  equals to the Whisker topology on π1X,x.

Yearly Impact: مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View 39

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesDownload 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesCitation 0 مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic ResourcesRefrence 0
litScript
telegram sharing button
whatsapp sharing button
linkedin sharing button
twitter sharing button
email sharing button
email sharing button
email sharing button
sharethis sharing button