• Login
    Search 
    •   etd@IISc
    • Division of Electrical, Electronics, and Computer Science (EECS)
    • Search
    •   etd@IISc
    • Division of Electrical, Electronics, and Computer Science (EECS)
    • Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Search

    Show Advanced FiltersHide Advanced Filters

    Filters

    Use filters to refine the search results.

    Now showing items 1-7 of 7

    • Sort Options:
    • Relevance
    • Title Asc
    • Title Desc
    • Issue Date Asc
    • Issue Date Desc
    • Results Per Page:
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100

    New Models and Methods for Formation and Analysis of Social Networks 

    Dhamal, Swapnil
    Social networks are an inseparable part of human lives, and play a major role in a wide range of activities in our day-to-day as well as long-term lives. The rapid growth of online social networks has enabled people to ...

    Rainbow Colouring and Some Dimensional Problems in Graph Theory 

    Rajendraprasad, Deepak (2018-04-05)
    This thesis touches three different topics in graph theory, namely, rainbow colouring, product dimension and boxicity. Rainbow colouring An edge colouring of a graph is called a rainbow colouring, if every pair of vertices ...

    Parameterized Complexity of Maximum Edge Coloring in Graphs 

    Goyal, Prachi (2018-03-09)
    The classical graph edge coloring problem deals in coloring the edges of a given graph with minimum number of colors such that no two adjacent edges in the graph, get the same color in the proposed coloring. In the following ...

    Rainbow Connection Number Of Graph Power And Graph Products 

    Arunselvan, R (2014-09-09)
    The minimum number of colors required to color the edges of a graph so that any two distinct vertices are connected by at least one path in which no two edges are colored the same is called its rainbow connection number. ...

    The Isoperimetric Problem On Trees And Bounded Tree Width Graphs 

    Bharadwaj, Subramanya B V (2010-08-26)
    In this thesis we study the isoperimetric problem on trees and graphs with bounded treewidth. Let G = (V,E) be a finite, simple and undirected graph. For let δ(S,G)= {(u,v) ε E : u ε S and v ε V – S }be the edge boundary ...

    Algorithmic and Combinatorial Questions on Some Geometric Problems on Graphs 

    Babu, Jasine (2018-05-08)
    This thesis mainly focuses on algorithmic and combinatorial questions related to some geometric problems on graphs. In the last part of this thesis, a graph coloring problem is also discussed. Boxicity and Cubicity: These ...

    Game-Theoretic Analysis of Strategic Behaviour in Networks, Crowds and Classrooms 

    Vallam, Rohith Dwarakanath (2018-01-03)
    Over the past decade, the explosive growth of the Internet has led to a surge of interest to understand and predict aggregate behavior of large number of people or agents, particularly when they are connected through an ...

    etd@IISc is a joint service of SERC & J R D Tata Memorial (JRDTML) Library || Powered by DSpace software || DuraSpace
    Contact Us | Send Feedback | Thesis Templates
    Theme by 
    Atmire NV
     

     

    Browse

    All of etd@IIScCommunities & CollectionsTitlesAuthorsAdvisorsSubjectsBy Thesis Submission DateThis CommunityTitlesAuthorsAdvisorsSubjectsBy Thesis Submission Date

    My Account

    LoginRegister

    Discover

    AuthorArunselvan, R (1)Babu, Jasine (1)Bharadwaj, Subramanya B V (1)Dhamal, Swapnil (1)Goyal, Prachi (1)Rajendraprasad, Deepak (1)Vallam, Rohith Dwarakanath (1)Subject
    Computer Science (7)
    Graph Theory (7)
    Cubicity (2)Social Networks (2)Trees (Graph Theory) (2)Treewidth Graphs (2)Bioxicity (1)Boxicity (1)Boxicity and Cubicity (1)C4-free Graphs (1)... View MoreDate Issued2018 (4)2010 (1)2014 (1)Has File(s)Yes (7)

    etd@IISc is a joint service of SERC & J R D Tata Memorial (JRDTML) Library || Powered by DSpace software || DuraSpace
    Contact Us | Send Feedback | Thesis Templates
    Theme by 
    Atmire NV